toIPA
Home
Blog
Category
P
computational complexity class of problems solvable by a deterministic Turing Machine in polynomial time
Pronunciation
/pi/
Categories
computational problem
complexity class