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

Author(s)

• Goldreich, Oded

Bibliographic Information

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

Oded Goldreich

Cambridge University Press, 2010

• : hbk
• : pbk

Note

Includes bibliographical references and index

Details

• NCID: BB03225198
• ISBN:
  • 9780521192484
  • 9780521122542
• LCCN: 2010023587
• Country Code: uk
• Title Language Code: eng
• Text Language Code: eng
• Place of Publication: Cambridge ; New York
• Pages/Volumes: xxix, 184 p.
• Size: 24 cm
• Classification:
  • LCC : QA267.7
  • DC22 : 005.1
• Subject Headings:
  • LCSH : Computational complexity
  • LCSH : Computer algorithms
  • LCSH : Approximation theory
  • LCSH : Polynomials