(definition)
Definition: A problem which has an algorithm which computes all instances of it in polynomial time.
See also intractable, decidable problem, solvable, computable.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 9 August 2004.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Paul E. Black, "tractable", in
Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 9 August 2004. (accessed TODAY)
Available from: https://www.nist.gov/dads/HTML/tractable.html