Polynomial Time
A core concept in computational complexity theory. It refers to algorithms whose running time grows no faster than some polynomial function of the input size, and it is commonly used as the boundary between what is considered practically feasible and what is considered theoretically infeasible.
Timeline (last 90 days)
P2NPCBench is a new benchmark comprising 12 question families, each consisting of an NP-complete problem and a polynomial-time solvable problem with identical surface wording.
Polynomial time is a core concept in computational complexity theory, referring to an algorithm whose running time grows no faster than some polynomial function of the input size.
All Facts (2)
P2NPCBench is a new benchmark comprising 12 question families, each consisting of an NP-complete problem and a polynomial-time solvable problem with identical surface wording.
50%UnverifiedPolynomial time is a core concept in computational complexity theory, referring to an algorithm whose running time grows no faster than some polynomial function of the input size.
50%