Complexity Explorer Santa Few Institute

Explore


P

Refers to the class of polynomial time problems:  those for which every instance can be solved in polynomial time (with respect to the size of the input).    See also NP.


Topics
Computer Science, Computation, Mathematics
Difficulty
1