P, NP and NP Completeness the basics of computational complexity

other_versions_link
Dades bibliogràfiques
Autor principal: Goldreich, Oded
Format: Printed Book
Idioma:English
Publicat: Cambridge Cambridge University Press 2010
Matèries:
Computational complexity > computer algorithms > Approximation theory > Polynomials
Search Result 1
P, NP and NP - completeness - the basics of computational complexity/
per Goldreich, Oded
Publicat 2010
Printed Book
Search Result 2
P, NP, and NP-completeness :The basics of computational complexity
per Goldreich, Oded
Publicat 2010
Printed Book
Search Result 3
P, NP, and NP-completeness : the basics of computational complexity /
per Goldreich, Oded
Publicat 2010
Cover image
Printed Book
other_versions_search_link

Ítems similars