Computing DictionaryThe set or property of problems for which it can be proven that no polynomial-time algorithm exists, only exponential-time algorithms.
| Sponsored Links: | |||
| Computing Dictionary | |||
| Definition: | The set or property of problems for which it can be proven that no polynomial-time algorithm exists, only exponential-time algorithms. | ||
| COPYRIGHT © 2000-2009 HYPERDICTIONARY.COM | HYPERDICTIONARY.COM |