Doporučené

www.cs.princeton.edu/theory/complexity/ 

Knihy

• Jose Luis Balcazar, Josep Diaz, Joaquim Gabarro: Structural Complexity I,II, Springer Verlag 1995
• Daniel Pierre Bovet, Pierluigi Crescenzi: Introducition to the Theory of Complexity, Prentice Hall 1993
• Michael R. Garey, David S. Johnson: Computers and Intractability: a Guide to the Theory of NP-completness, W.H.Freeman and Company, San Francisco, 1979
• Lane A. Hemaspaandra, Mitsumori Ogihara: The Complexity Theory Companion. Springer, 2005
• Christos H. Papadimitriou: Computational Complexity, Addison-Wesley 1994
• Uwe Schonig, Randall Pruim: Gems of Theoretical Computer Science, Springer Verlag, 1998
• Michale Sipser: Introduction to the Theory of Computation, PWS Publishing Company 1996
• Ingo Wegener: Complexity Theory (Exploring the Limits of Efficient Algorithms, Springer 2003
• Dexter Kozen: Theory of Computation. Springer 2006
• Maribel Fernández" Models of Computation. Springer 2009 

On-line knihy, weby a blogy

Alan Turing

The Alan Turing Year

Gödel’s Lost Letter and P=NP

Computational Complexity blog

NP-Completeness Columns

Complexity ZOO

Bulletin of the European Association for Theoretical Computer Science (Computational Complexity Column)

Laszlo Lovasz: Computation Complexity

Ingo Wegener: The Complexity of Boolean Functions

Johan Hastad: Complexity Theory

Pierluigi Crescenzi and Viggo Kann: A compendium of NP optimization problems

Raymond Greenlaw, H. James Hoover, Walter L. Ruzzo: Limits to Parallel Computation: P-Completeness Theory

Richard Ladner: Complexity Theory Lectures

Herbert Wilf:Algorithms and Complexity

Uri Zwick: Boolean Circuit Complexity

Oded Goldreich: Foundations of Cryptography

Oded Goldreich: Probabilistic Proof Systems

Oded Goldreich: Introduction to Complexity Theory

a jine