P, NP, and NP-completeness :
Goldreich, Oded.
P, NP, and NP-completeness : the basics of computational complexity Oded Goldreich. - 1st pub 2010 - New York : Cambridge University Press, 2010. - 184 p. : ill. ;
Includes bibliographical references and index.
9780521192484 (hardback) 9780521122542 (pbk.)
Computational complexity.
Computer algorithms.
Approximation theory.
Polynomials.
005.1 / GOL-P
P, NP, and NP-completeness : the basics of computational complexity Oded Goldreich. - 1st pub 2010 - New York : Cambridge University Press, 2010. - 184 p. : ill. ;
Includes bibliographical references and index.
9780521192484 (hardback) 9780521122542 (pbk.)
Computational complexity.
Computer algorithms.
Approximation theory.
Polynomials.
005.1 / GOL-P