| Polynomial Time |
Article Index for Polynomial |
Website Links For Time |
Information AboutPolynomial Time |
| CATEGORIES ABOUT POLYNOMIAL TIME | |
| computational complexity theory | |
|
Written mathematically, ''m''(''n'') = O (''n''''k'') where ''k'' is a constant (which may depend on the problem). Mathematicians sometimes use the notion of "polynomial time on the length of the input" as a definition of a "fast" computation, as opposed to "super-polynomial time", which is anything slower than that. Exponential Time is one example of a super-polynomial time. The Complexity Class of Decision Problem s that can be solved on a deterministic sequential machine in polynomial time is known as P . The class of decision problems that can be verified in polynomial time is known as ''' NP '''. Equivalently, NP is the class of decision problems that can be solved in polynomial time on a Non-deterministic Turing Machine (NP stands for Nondeterministic '''P'''olynomial time). Polynomial time is the smallest time-complexity class on a deterministic machine which is Robust in terms of machine model changes, and is the smallest class closed under composition of subproblems. SUBCLASSES OF POLYNOMIAL TIME SEE ALSO
|
|
|