Normal view MARC view ISBD view

P, NP, and NP-completeness : the basics of computational complexity

Goldreich, Oded

P, NP, and NP-completeness : the basics of computational complexity Goldreich, Oded - Cambridge 2010

Dewey Class. No.: 005.1 / T10 GOL

Print
Add to your cart (remove)
Suggest for purchase
Send to device
Save record
BIBTEX Dublin Core MARCXML MARC (non-Unicode/MARC-8) MARC (Unicode/UTF-8) MARC (Unicode/UTF-8, Standard) MODS (XML) RIS ISBD
More searches

Search for this title in:
Other Libraries (WorldCat) Other Databases (Google Scholar) Online Stores (Bookfinder.com) Open Library (openlibrary.org)