Catalog
- Results include
-
Computational complexity : CC.
Basel : Birkhäuser - <2010-> : Basel : SpringerOnline Find full text
-
Computational complexity
Wagner, K. (Klaus)Dordrecht ; Boston : Reidel Pub. Co. : Hingham, MA, U.S.A. : Distributors for the U.S.A. and Canada, Kluwer Academic Publishers, c1986. -
Computational complexity
Papadimitriou, Christos H.Reading, Mass. : Addison-Wesley, c1994.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.
Guides
Library website
-
Library accessibility
Accessibility resources for using the Libraries
Exhibits
EarthWorks
More search tools
Tools to help you discover resources at Stanford and beyond.