Physical and digital books, media, journals, archives, and databases.
Results include
  1. Computational complexity : CC.

    Basel : Birkhäuser - <2010-> : Basel : Springer

    Online Find full text

  2. 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.

  3. 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

Course- and topic-based guides to collections, tools, and services.
No guide results found... Try a different search
Library info; guides & content by subject specialists
  1. Library accessibility

    Accessibility resources for using the Libraries

Exhibits

Digital showcases for research and teaching.
No exhibits results found... Try a different search

EarthWorks

Geospatial content, including GIS datasets, digitized maps, and census data.
No earthworks results found... Try a different search

More search tools

Tools to help you discover resources at Stanford and beyond.