-
One of the Prize Problems named by the Clay Mathematics Institute of Cambridge, Massachusetts (CMI).
-
This is a preliminary version of the catalog of NP optimization problems.
-
The Oxford University Computing Laboratory's area on algorithms and complexity, with links to lectures and information.
-
Course 6.045J / 18.400J at MIT OpenCourseWare with introduction to basic mathematical models of computation, Turing machines, Church's Thesis, time complexity and NP-completeness.
-
Provides an overview, including surveys and a bibliography, of recent work on average-case complexity analysis.
-
Includes related links, references and a summary of the results for the SAT benchmarks used in SAT Competition 2004.
-
Two set of lecture notes by Prof. Oded Goldreich, Weizmann Institute.
-
Description of the 462 complexity classes and relations between them hosted at Caltech as a part of Qwiki project.
-
A list of topics from a Computer Science course involving complexity of algorithms. HTML and PS format.
-
An online course on complexity.
-
Course COMS 30126: Computational Complexity Theory, Department of Computer Science, University of Bristol
-
Summaries of talks of the DIMACS workshop (July 1996), collected by James Royer.
-
Research group in the Computing Laboratory, Oxford University.
-
Course taught by Christos Papadimitriou and Umesh Vazirani at the University of California at Berkeley.
-
ECCC publishes research reports, surveys and books in computational complexity and is hosted by the University of Trier.
-
An overview of computational models and methods and how they relate to complexity, with links to selected papers.
-
People, publications, prizes.
-
Collection of lecture notes by Prof. Eric Allender, Rutgers University.
-
Brief description, list of workers and problem compendium, compiled by Todd Wareham.
-
Pointers to some survey articles and their authors, by M. Bellare.
-
A collection of up-to-date links about the satisfiability problem (solvers, benchmarks, articles). A discussion forum is available as well.
-
A collection of benchmark problems, solvers, and tools. Provides a uniform test-bed for SAT solvers as well as a site for collecting SAT problem instances, algorithms, and empirical characterisations of the algorithms' performance.
-
A collection of bookmarks to algorithms and complexity resources maintained by Heribert Vollmer at the Theoretical Computer Science Institute, University of Hannover.
-
Course 6.045J/18.400J at MIT OpenCourseWare, emphasizing computability and computational complexity theory.
