Computers and Intractability: A Guide to the Theory of NP-Completeness

Results: 1



#Item
1Complexity classes / Bin packing problem / NP-complete / ACM SIGACT / Crossing number / Linear programming / Randomized algorithm / Edward G. Coffman / Jr. / Computers and Intractability: A Guide to the Theory of NP-Completeness / Theoretical computer science / Applied mathematics / Computational complexity theory

DAVID S. JOHNSON Address: 523 Computer Science Building Mail Code 0401 Department of Computer Science

Add to Reading List

Source URL: davidsjohnson.net

Language: English - Date: 2014-01-22 11:11:57
UPDATE