You are here: irt.org | FOLDOC | non-polynomial
<complexity> The set or property of problems for which no
polynomial-time algorithm is known.
This includes problems for which the only known algorithms
require a number of steps which increases exponentially with
the size of the problem, and those for which no algorithm at
all is known. Within these two there are problems which are
"provably difficult" and "provably unsolvable".
Nearby terms: non-optimal solution « Nonpareil « non parity « non-polynomial » Non Return to Zero Inverted » nontrivial » Non-Uniform Memory Access
FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL
©2018 Martin Webb