(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 9 August 2004.
HTML page formatted Fri Mar 25 16:20:35 2011.
Cite this as:
Paul E. Black, "tractable", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 9 August 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/tractable.html
