(definition)
Definition: A problem for which no algorithm can exist which computes all instances of it in polynomial time.
See also tractable, undecidable problem, unsolvable problem.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Wed Oct 30 12:15:30 2024.
Cite this as:
Paul E. Black, "intractable", in
Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/intractable.html