(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 E. Black.
Entry modified Mon Aug 9 15:48:17 2004.
HTML page formatted Wed Oct 26 09:48:17 2005.
Cite this as:
Paul E. Black, "tractable", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/tractable.html
