Q846354

From Wikidata
Jump to: navigation, search

P(Q846354)

Computational complexity class of problems solvable by a deterministic Turing Machine in polynomial time.
  • P class
  • PTIME
[edit]
Language Label Description Also known as
English
P
Computational complexity class of problems solvable by a deterministic Turing Machine in polynomial time.
  • P class
  • PTIME

Statements

/m/030dh2
1 reference
0 references