|
Related articles:
Algorithm
NP (complexity)
Computational complexity theory
Linear programming
Key terms: math algorithm size running machine input polynomial time model log computation problem integers complexity given bounded running time solved constant decision turing machine complexity class two integers arithmetic operations arithmetic model polynomial time if strongly polynomial time possible to compute model of computation integers in the input weakly polynomial time polynomial time algorithm Search external links cited by footnotes on Wikipedia page Polynomial time: |
|