P (polynomial time)

E1751080 UNEXPLORED

P (polynomial time) is the class of decision problems that can be solved by a deterministic Turing machine in time bounded by a polynomial function of the input size, and is widely regarded as the formal notion of efficiently solvable problems in computational complexity theory.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (1)

Label	Occurrences
P (polynomial time) canonical	1

Referenced by (1)

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

EXPTIME → contrastWith → P (polynomial time) ⓘ

subject linked to: complexity class EXPTIME