P versus NP

P versus NP

• P - Problems with efficiently (polynomial-time) computable solutions
• NP - Problems with efficiently verifiable solutions
• NP-complete - Hardest problems in NP (Boolean Formula Satisfiability)

Previous slide

Next slide

Back to the first slide

View Graphic Version