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

Bibliographic Details
Main Author:	Goldreich, Oded
Corporate Author:	ebrary, Inc
Format:	eBook
Language:	English
Published:	Cambridge ; New York : Cambridge University Press, [2010]
Subjects:	Computational complexity. Computer algorithms. Approximation theory. Polynomials. Electronic books.
Online Access:	Connect to the full text of this electronic book

Description
Item Description:	Electronic resource.
Physical Description:	xxix, 184 pages : illustrations
Bibliography:	Includes bibliographical references and index.