← Jargon

Jargoncomputer science· 7 claims· 1 episode

P

The complexity class of problems solvable in polynomial time; informally, the 'efficiently solvable' problems.

As defined in 99 | Scott Aaronson on Complexity, Computation, and Quantum Gravity


Where it comes up · 1

Most important claims · 7 of 7Search all claims for “P” →