An overview of computational models and methods and how they relate to complexity, with links to selected papers.

Collection of lecture notes by Prof. Eric Allender, Rutgers University.

Course taught by Christos Papadimitriou and Umesh Vazirani at the University of California at Berkeley.

Research group in the Computing Laboratory, Oxford University.

Includes related links, references and a summary of the results for the SAT benchmarks used in SAT Competition 2004.

Provides applets that can be used to explore the conditions under which some well-known NP-complete problems become hard.

A list of topics from a Computer Science course involving complexity of algorithms. HTML and PS format.

Brief description, list of workers and problem compendium, compiled by Todd Wareham.

Definition of the subject, links.

A forum for the rapid and widespread interchange of ideas, techniques, and research in computational complexity. Research reports, surveys and books; meetings, discussions and web resources.