Computational Complexity

Christos Papadimitriou

ISBN 10: 0201530821 / ISBN 13: 9780201530827

Editore: Pearson November 1993, 1993

Riguardo questo articolo

Previous owner's name on first page, no writing or marks in text, tight and square, but dust jacket has taken some hits.

Codice articolo 235538

Dati bibliografici

• Titolo: Computational Complexity
• Editore: Pearson November 1993
• Data di pubblicazione: 1993
• Lingua: Inglese
• ISBN 10: 0201530821
• ISBN 13: 9780201530827
• Rilegatura: Trade Paperback
• Condizione: Used Good
• Condizione della sovraccoperta: Fair
• Cataloghi dei venditori:
  • Computer

Descrizione articolo

Riassunto

<p>This text offers a comprehensive and accessible treatment of the theory of algorithms and complexity - the elegant body of concepts and methods developed by computer scientists over the past 30 years for studying the performance and limitations of computer algorithms. Among topics covered are: reductions and NP-completeness, cryptography and protocols, randomized algorithms, and approximability of optimization problems, circuit complexity, the "structural" aspects of the P=NP question, parallel computation, the polynomial hierarchy, and many others. Several sophisticated and recent results are presented in a rather simple way, while many more are developed in the form of extensive notes, problems, and hints. The book is surprisingly self-contained, in that it develops all necessary mathematical prerequisites from such diverse fields as computability, logic, number theory, combinatorics and probability.</p>

Dalla quarta di copertina

<p></p> <blockquote> <p>This new text offers a comprehensive and accessible treatment of the theory of algorithms and complexity - the elegant body of concepts and methods developed by computer scientists over the past 30 years for studying the performance and limitations of computer algorithms. Among topics covered are: reductions and NP-completeness, cryptography and protocols, randomized algorithms, and approximability of optimization problems, circuit complexity, the "structural" aspects of the P=NP question, parallel computation, the polynomial hierarchy, and many others.</p> <p>Several sophisticated and recent results are presented in a rather simple way, while many more are developed in the form of extensive notes, problems, and hints. The book is surprisingly self-contained, in that it develops all necessary mathematical prerequisites from such diverse field as computability, logic, number theory, combinatorics, and probability.</p> <b>Features</b> <ul> <li>First unified introduction to computational complexity.</li> <li>Integrates computation, applications, and logic throughout.</li> <li>Provides an accessible introduction to logic, including Boolean logic, first-order logic, and second-order logic.</li> <li>Includes extensive exercises including historical notes, references, and challeging problems.</li> </ul> </blockquote> <br> <br> 0201530821B04062001 <p></p>