Σ₂^P

Σ₂^P
Name	Σ₂^P
Alternate names	Sigma-two-P
Type	Complexity class
Contains	NP, co-NP
Related	Π₂^P, PH, PSPACE

Σ₂^P

Σ₂^P is a complexity class in theoretical computer science that occupies the second level of the Polynomial hierarchy and captures decision problems solvable by a nondeterministic polynomial-time machine with access to an NP oracle. It relates to concepts studied by researchers at institutions such as Bell Labs, IBM Research, Microsoft Research, MIT, Stanford University, and Princeton University and appears in work by theorists connected to Cook–Levin theorem, Karp–Lipton theorem, Toda's theorem, Ladner's theorem, and Fortnow.

Definition

Formally, Σ₂^P comprises languages decidable by a polynomial-time verifier with an existential quantifier followed by a universal quantifier over polynomially bounded strings, as used in proofs at Courant Institute, University of California, Berkeley, University of Illinois Urbana–Champaign, Carnegie Mellon University, and California Institute of Technology. Equivalent characterizations involve nondeterministic polynomial-time Turing machines with an oracle for NP, or alternating Turing machines with two alternations beginning with an existential state, frameworks analyzed in seminars at Institute for Advanced Study, École Normale Supérieure, University of Cambridge, University of Oxford, and Harvard University. The class is defined in textbooks by authors affiliated with Princeton University Press, Springer-Verlag, Cambridge University Press, and research from SIAM.

Relationships within the Polynomial Hierarchy

Σ₂^P is the second existential level of the Polynomial hierarchy and sits above NP and co-NP and below Π₂^P and higher levels, relationships explored by scholars at Rutgers University, New York University, University of Toronto, McGill University, ETH Zurich, University of Bonn, and Max Planck Institute for Informatics. Collapse results connecting levels reference the Karp–Lipton theorem, work influenced by Richard Karp, Richard Lipton, and discussions at Symposium on Theory of Computing. Containments such as Σ₂^P ⊆ PSPACE are standard in lecture notes from University of California, San Diego, University of Wisconsin–Madison, Brown University, Duke University, and Yale University. Oracle separations and relativization techniques were developed in contexts including Los Alamos National Laboratory, Bell Labs, and conferences like FOCS and STOC.

Complete Problems and Examples

Canonical Σ₂^P-complete problems include variants of quantified satisfiability like ∃∀-QSAT used in coursework at Columbia University, University of Washington, University of Michigan, Cornell University, and Brown University. Optimization and verification problems with alternation, studied at NASA Ames Research Center, Jet Propulsion Laboratory, Siemens, and Bell Labs, often yield Σ₂^P-complete instances. Database theory problems and logic programming tasks from projects at Oracle Corporation, SAP, Red Hat, and Facebook can be Σ₂^P-hard; seminal reductions trace to researchers associated with AT&T Labs, Yahoo! Research, Google Research, and Intel Labs. Game-theoretic decision problems and model-checking tasks appearing in workshops at ACM SIGACT, IEEE, and IFIP also provide Σ₂^P-complete examples.

Structural Properties and Collapse Results

Structural results about Σ₂^P include potential collapses of the Polynomial hierarchy to its second level if specific unlikely containments hold, topics addressed in seminars at University of Illinois, Johns Hopkins University, University of Maryland, Texas A&M University, and University of Pennsylvania. The Karp–Lipton theorem implies consequences for Σ₂^P when circuit complexity classes like P/poly, studied by groups at Bell Labs and Microsoft Research, contain NP. Diagonalization and relativization results involving Σ₂^P were established in publications from ACM, IEEE, and SIAM conferences. Complete and sparse sets for Σ₂^P, as well as immunity and lowness properties, have been pursued by researchers at Rutgers University, Birkbeck, University of London, University of Sheffield, and University of Melbourne.

Reducibilities and Circuit Characterizations

Reducibilities such as polynomial-time many-one reductions, truth-table reductions, and Turing reductions are used to relate Σ₂^P languages, a methodology taught at École Polytechnique, Imperial College London, University of Edinburgh, University of Glasgow, and University of Leeds. Circuit characterizations connect Σ₂^P to Boolean circuits with quantifier alternation correspondences; these connections are explored in work at Princeton University, Harvard University, Columbia University, New York University, and University of California, Los Angeles. Results about circuit lower bounds and completeness link Σ₂^P to studies at MIT Lincoln Laboratory, DARPA-funded projects, and industry labs like Intel Research and Bell Labs.

Applications and Implications in Complexity Theory

Understanding Σ₂^P informs hardness assumptions for cryptographic primitives and derandomization efforts undertaken by teams at NSA, Microsoft Research, IBM Research, Google Research, and NIST. Connections to parameterized complexity and approximation, topics developed at Karlsruhe Institute of Technology, Leiden University, University of Amsterdam, University of Warsaw, and University of Helsinki, translate into implications for algorithms in planning and verification used by Siemens, Airbus, Boeing, and General Electric. Broader implications tie Σ₂^P to descriptive complexity results framed by the Ehrenfeucht–Fraïssé games tradition and institutions like CNRS and Max Planck Society, influencing curricula at Massachusetts Institute of Technology, University of Chicago, and University of California, Santa Barbara.

Category:Complexity classes