P, NP, and NP-Completeness
| Glavni avtor: | Oded Goldreich |
|---|---|
| Format: | Elektronski eKnjiga |
| Jezik: | English |
| Izdano: |
Cambridge University Press,
06/05/2012
|
| Izdaja: | 1 |
| Teme: | |
| Online dostop: | Full text available on Cambridge University Press Off-campus access |
Podobne knjige/članki
-
Tractability
od: Edited by Lucas Bordeaux, Youssef Hamadi, Pushmeet Kohli
Izdano: (2014) -
Modern Computer Arithmetic
od: Richard P. Brent, Paul Zimmermann
Izdano: (2012) -
Iterative Methods in Combinatorial Optimization
od: Lap Chi Lau, R. Ravi, Mohit Singh
Izdano: (2012) -
Computers and intractability : a guide to the theory of NP-completeness /
od: Garey, Michael R.
Izdano: (1979) -
Surveys in Combinatorics 2013
od: Edited by Simon R. Blackburn, Stefanie Gerke, Mark Wildon
Izdano: (2013)