Automata, Computability, and Complexity, Spring 2005  ocw.mit.edu/OcwWeb/Electrical-Engineering-and-Computer-Science/6-045JS… 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.

Challenging Benchmarks for SAT and CSP  www.nlsde.buaa.edu.cn/~kexu/benchmarks/benchmarks.htm Includes related links, references and a summary of the results for the SAT benchmarks used in SAT Competition 2004.

A Compendium of NP Optimization Problems  www.nada.kth.se/~viggo/problemlist/compendium.html This is a preliminary version of the catalog of NP optimization problems.

Complexity of Algorithms  artemis.cs.yale.edu/classes/cs460/Spring98/contents.html A list of topics from a Computer Science course involving complexity of algorithms. HTML and PS format.

Complexity Theory  www.wisdom.weizmann.ac.il/~oded/cc.html Two set of lecture notes by Prof. Oded Goldreich, Weizmann Institute.

Complexity Zoo  qwiki.stanford.edu/wiki/Complexity_Zoo Description of the 462 complexity classes and relations between them hosted at Caltech as a part of Qwiki project.

Computability and Complexity  www.csc.liv.ac.uk/~ped/teachadmin/algor/comput_complete.html An online course on complexity.

Computational Complexity and Programming Languages  www.cis.syr.edu/people/royer/talks.html Summaries of talks of the DIMACS workshop (July 1996), collected by James Royer.

Computational Complexity Theory  www.cs.umass.edu/~immerman/complexity_theory.html Definition of the subject, links.

Computational Complexity Theory  www.cs.bris.ac.uk/Teaching/Resources/COMS30126 Course COMS 30126: Computational Complexity Theory, Department of Computer Science, University of Bristol

Computational Complexity Theory  en.wikipedia.org/wiki/Computational_complexity_theory Wikipedia article.

Constraint Satisfaction Problems  www.comlab.ox.ac.uk/activities/constraints Research group in the Computing Laboratory, Oxford University.

ECCC - Electronic Colloquium on Computational Complexity  eccc.hpi-web.de 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.

Efficient algorithms and intractable problems  www-inst.eecs.berkeley.edu/~cs170/fa06 Course taught by Christos Papadimitriou and Umesh Vazirani at the University of California at Berkeley.

IBM Research: Algorithms & Theory  domino.research.ibm.com/comm/research.nsf/pages/r.algorithms.html An overview of computational models and methods and how they relate to complexity, with links to selected papers.

Information-based Complexity  www.ibc-research.org People, publications, prizes.

Lecture notes on Complexity  www.cs.rutgers.edu/~allender/lecture.notes Collection of lecture notes by Prof. Eric Allender, Rutgers University.

$1 million for solving P vs NP  www.claymath.org/millennium/P_vs_NP One of the Prize Problems named by the Clay Mathematics Institute of Cambridge, Massachusetts (CMI).

Parameterized Complexity  www.cs.mun.ca/~harold/W_hier/W_hier.html Brief description, list of workers and problem compendium, compiled by Todd Wareham.

Probabilistically Checkable Proofs and Approximation  www-cse.ucsd.edu/users/mihir/pcp.html Pointers to some survey articles and their authors, by M. Bellare.

SAT Live!  www.satlive.org A collection of up-to-date links about the satisfiability problem (solvers, benchmarks, articles). A discussion forum is available as well.

SATLIB - The Satisfiability Library  www.satlib.org 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.

Theoretical Computer Science links  www.thi.uni-hannover.de/en/research/links A collection of bookmarks to algorithms and complexity resources maintained by Heribert Vollmer at the Theoretical Computer Science Institute, University of Hannover.

Theory of Computation, Fall 2006  ocw.mit.edu/OcwWeb/Mathematics/18-404JFall-2006/CourseHome Course 6.045J/18.400J at MIT OpenCourseWare, emphasizing computability and computational complexity theory.