← Jargon

Jargoncomputer science· 5 claims· 1 episode

NP

The complexity class of problems whose 'yes' answers can be verified in polynomial time given a proposed solution; stands for non-deterministic polynomial.

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


Where it comes up · 1

Most important claims · 5 of 5Search all claims for “NP” →