Beta Phase: Square45 is currently in beta testing. Expect some features or content to be incomplete or missing.
45

Complexity Classes

Field: Analysis of Algorithms

Sets of problems of related resource-based complexity.

Sequence of Expressions

Definition

NP-Complete

Advanced
A problem LL is NP-complete if L∈NPL \in NP and every problem in NPNP is reducible to LL in polynomial time.