Class NP

Last updated Jun 23, 2022

• Type atom
• Status needs revision

Class NP (the N stands for a non-deterministic Turing machine, and the P stands for polynomial) problems are those problems whose solution can be quickly verified by a computer in polynomial time.

It includes problems such as:

• Factoring
• Graph Isomorphism

• Chapter 1 - Classical Information and Computation > ^51019f
• Chapter 1 - Classical Information and Computation > ^f828ff