P, NP and NP Completeness the basics of computational complexity

other_versions_link
Bibliographic Details
Main Author: Goldreich, Oded
Format: Printed Book
Language:English
Published: Cambridge Cambridge University Press 2010
Subjects:
Computational complexity > computer algorithms > Approximation theory > Polynomials

UL

Holdings details from UL
Call Number: 519.6 GOL
Copy Live Status Unavailable

Similar Items