P, NP, and NP-Completeness
| Prif Awdur: | Oded Goldreich |
|---|---|
| Fformat: | Electronig eLyfr |
| Iaith: | English |
| Cyhoeddwyd: |
Cambridge University Press,
06/05/2012
|
| Rhifyn: | 1 |
| Pynciau: | |
| Mynediad Ar-lein: | Full text available on Cambridge University Press Off-campus access |
Eitemau Tebyg
-
Tractability
gan: Edited by Lucas Bordeaux, Youssef Hamadi, Pushmeet Kohli
Cyhoeddwyd: (2014) -
Modern Computer Arithmetic
gan: Richard P. Brent, Paul Zimmermann
Cyhoeddwyd: (2012) -
Iterative Methods in Combinatorial Optimization
gan: Lap Chi Lau, R. Ravi, Mohit Singh
Cyhoeddwyd: (2012) -
Computers and intractability : a guide to the theory of NP-completeness /
gan: Garey, Michael R.
Cyhoeddwyd: (1979) -
Surveys in Combinatorics 2013
gan: Edited by Simon R. Blackburn, Stefanie Gerke, Mark Wildon
Cyhoeddwyd: (2013)