Example image of eyePlorer eyePlorer map for 'Sharp-P': Computational complexity theory Decision problem NP (complexity) Function problem Graph theory Hamiltonian path Subset sum problem Conjunctive normal form Travelling salesman problem Boolean satisfiability problem Oracle machine PH (complexity) Polynomial hierarchy Toda's theorem P (complexity) Sharp-P-complete PP (complexity) Parity P Leslie Valiant Permanent GapP P Sharp Permanent is sharp-P-complete Counting problem (complexity) Real computation Canadian traveller problem Real number Chromatic polynomial IP (complexity) Eulerian path
Disclaimer