Back to Discover
🔢

P (complexity)

math Maturity 11-13

Computers solve many puzzles. Some puzzles are fast to solve. These are easy for a computer. We call these fast puzzles P. It helps us use machines well.

Complexity-classes-polynomial.svg
Complexity-classes-polynomial.svg
Can you find a fast puzzle?

35 words
🖼️ Images & Media (3)
File:Complexity subsets pspace.svg
Complexity subsets pspace.svg
File:Complexity-classes-polynomial.svg
Complexity-classes-polynomial.svg
File:Randomised Complexity Classes 2.svg
Randomised Complexity Classes 2.svg
Up Next
🔢
NP (complexity)
Math
→
More to explore

✨ What else?

Related topics you might enjoy

NP (complexity) 0% NP-hardness 0% Decision problem 0% Oracle machine 0% Computable function 0% Time hierarchy theorem 0%

🔬 Go deeper

More advanced topics to explore

Decision problem Nondeterministic Turing machine Space complexity Theory of computation

🪜 Step back

Simpler topics to build understanding

NP (complexity) NP-hardness Computational complexity theory Oracle machine
📚 Content adapted from Wikipedia | Readability: FK 13.8 | Vital Level 5