Misplaced Pages

The following pages link to Polynomial hierarchy

• (link count
• transclusion count
• sorted list) · See help page for transcluding these entries

Showing 50 items.

• BPP (complexity) (links | edit)
• BQP (links | edit)
• Boolean satisfiability problem (links | edit)
• P versus NP problem (links | edit)
• Co-NP (links | edit)
• Computational complexity theory (links | edit)
• NP (complexity) (links | edit)
• NC (complexity) (links | edit)
• Oracle machine (links | edit)
• Presburger arithmetic (links | edit)
• ♯P (links | edit)
• ♯P-complete (links | edit)
• PSPACE (links | edit)
• Co-NP-complete (links | edit)
• NP-hardness (links | edit)
• P-complete (links | edit)
• PSPACE-complete (links | edit)
• NP-easy (links | edit)
• EXPTIME (links | edit)
• EXPSPACE (links | edit)
• RP (complexity) (links | edit)
• ZPP (complexity) (links | edit)
• Polynomial-time reduction (links | edit)
• Interactive proof system (links | edit)
• Arithmetical hierarchy (links | edit)
• Graph isomorphism (links | edit)
• Richard M. Karp (links | edit)
• UP (complexity) (links | edit)
• List of mathematical logic topics (links | edit)
• List of computability and complexity topics (links | edit)
• Complexity class (links | edit)
• Probabilistically checkable proof (links | edit)
• NSPACE (links | edit)
• DSPACE (links | edit)
• DTIME (links | edit)
• NTIME (links | edit)
• P (complexity) (links | edit)
• PH (complexity) (links | edit)
• PP (complexity) (links | edit)
• Arthur–Merlin protocol (links | edit)
• FP (complexity) (links | edit)
• FNP (complexity) (links | edit)
• List of complexity classes (links | edit)
• NEXPTIME (links | edit)
• Exponential hierarchy (links | edit)
• Elementary recursive function (links | edit)
• List of terms relating to algorithms and data structures (links | edit)
• Alternating Turing machine (links | edit)
• Reduction (complexity) (links | edit)
• Default logic (links | edit)