P, NP, and NP-Completeness
| Main Author: | Oded Goldreich |
|---|---|
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Cambridge University Press,
06/05/2012
|
| Edition: | 1 |
| Subjects: | |
| Online Access: | Full text available on Cambridge University Press Off-campus access |
Similar Items
-
Tractability
by: Edited by Lucas Bordeaux, Youssef Hamadi, Pushmeet Kohli
Published: (2014) -
Modern Computer Arithmetic
by: Richard P. Brent, Paul Zimmermann
Published: (2012) -
Iterative Methods in Combinatorial Optimization
by: Lap Chi Lau, R. Ravi, Mohit Singh
Published: (2012) -
Computers and intractability : a guide to the theory of NP-completeness /
by: Garey, Michael R.
Published: (1979) -
Surveys in Combinatorics 2013
by: Edited by Simon R. Blackburn, Stefanie Gerke, Mark Wildon
Published: (2013)