1 / 7

Complexity Classes

Complexity Classes. Karl Lieberherr. Source. From http://people.cs.umass.edu/~immerman/descriptive_complexity.html. Polynomial-time Hierarchy. complete. complete. SO. coNP=SO A. NP=SO E. NP intersect coNP. complete. P. Existential second-order logic.

bianca
Download Presentation

Complexity Classes

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Complexity Classes Karl Lieberherr

  2. Source • From • http://people.cs.umass.edu/~immerman/descriptive_complexity.html

  3. Polynomial-time Hierarchy complete complete SO coNP=SO A NP=SO E NP intersect coNP complete P

  4. Existential second-order logic 3-colorability can be expressed quite informally as: ∃ a coloring (“the coloring is a 3-coloring of the graph”) A little more formally as: ∃R∃G∃B (“Every point is in exactly one of the sets R, G, or B, and no two points that are connected by an edge are both in R, or both in G, or both in B”) This formula can be expressed formally in existential second-order logic (∃SO) So 3-colorability can be expressed in ∃SO.

  5. Capturing NP with logic Fagin’s Theorem (1974): NP = ∃SO Example: 3-colorability Surprising, since characterizing a complexity class in terms of logic, where there is no notion of machine, computation, polynomial, or time.

  6. NP and coNP • NP is the set of languages that have short proofs. • coNP is the set of languages that have short refutations. • Note that coNP is not the complement of NP. NP intersect coNP is non-empty.

  7. Problems believed to be in NP intersect coNP but not in P • Graph Isomorphism • several others

More Related