P

E1465260 UNEXPLORED

P is the fundamental complexity class consisting of all decision problems that can be solved by a deterministic Turing machine in polynomial time.

All labels observed (1)

Label Occurrences
P canonical 2

How this entity was disambiguated

Referenced by (2)

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