Complexity classes defined by how long a problem takes to solve or to check. The class P holds decision problems solvable in polynomial time by a deterministic machine, and NP holds those whose solutions can be verified in polynomial time. The related classes NP-hard, NP-complete and co-NP describe the hardest problems in NP, the problems that reduce to them, and the problems whose no-answers can be verified quickly.
Browse By
Polynomial and Nondeterministic Time Classes
Filter Results5 entries
Sources
Wikipedia: NP-completeness
Wikimedia FoundationHas Member: NP-Completeness, LeadQuote, Has Member: NP-Completeness, Lead
In computational complexity theory, NP-complete problems are the hardest of the problems to which solutions can be verified quickly.
P (complexity), Wikipedia
Has Member: P (Complexity Class), LeadQuote, Has Member: P (Complexity Class), Lead
In computational complexity theory, P, also known as PTIME or DTIME(nO(1)), is a fundamental complexity class.
NP (complexity), Wikipedia
Has Member: NP (Complexity Class), LeadQuote, Has Member: NP (Complexity Class), Lead
In computational complexity theory, NP (nondeterministic polynomial time) is a complexity class used to classify decision problems.
NP-hardness, Wikipedia
Has Member: NP-Hard, LeadQuote, Has Member: NP-Hard, Lead
In computational complexity theory, a computational problem H is called NP-hard if, for every problem L which can be solved in non-deterministic polynomial-time, there is a polynomial-time reduction from L to H.
co-NP, Wikipedia
Has Member: Co-NP, LeadQuote, Has Member: Co-NP, Lead
In computational complexity theory, co-NP is a complexity class.
Reader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.