P, NP and NP Completeness the basics of computational complexity

other_versions_link
Opis bibliograficzny
1. autor: Goldreich, Oded
Format: Printed Book
Język:English
Wydane: Cambridge Cambridge University Press 2010
Hasła przedmiotowe:
Computational complexity > computer algorithms > Approximation theory > Polynomials
Search Result 1
P, NP and NP - completeness - the basics of computational complexity/
od Goldreich, Oded
Wydane 2010
Printed Book
Search Result 2
P, NP, and NP-completeness :The basics of computational complexity
od Goldreich, Oded
Wydane 2010
Printed Book
Search Result 3
P, NP, and NP-completeness : the basics of computational complexity /
od Goldreich, Oded
Wydane 2010
Cover image
Printed Book
other_versions_search_link

Podobne zapisy