class P

E1750897 UNEXPLORED

Class P is the set of decision problems that can be solved by a deterministic Turing machine in polynomial time, commonly regarded as the class of efficiently solvable problems in computational complexity theory.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
class P canonical	1

Referenced by (1)

Full triples — surface form annotated when it differs from this entity's canonical label.

Papadimitriou: Computational Complexity → topic → class P ⓘ