Algorithms and Complexity - A downloadable textbook by Herbert S. Wilf.

ECCC - Electronic Colloquium on Computational Complexity - The Electronic Colloquium on Computational Complexity is a new forum for the rapid and widespread interchange of ideas, techniques, and research in computational complexity. The Electronic Colloquium on Computational Complexity (ECCC) welcomes papers, short notes and surveys with relevance to the theory of computation

Computability Theory - Directory of researchers working in computability theory, and list of open problems.

Bibliographic Database for Computability Theory - Extensive bibliography on computability and recursion theory, maintained by Peter Cholak.

SATLIB - The Satisfiability Library - A collection of benchmark problems, solvers, and tools. One strong motivation for creating SATLIB is to provide 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.

The P versus NP Problem - Description of the P vs NP question, designated a Clay Mathematics Institute Millennium Prize Problems, by Stephen Cook.

Stas Busygin's NP-Completeness Page - A proposal for solving NP-hard problems.

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

IEEE Conference on Computational Complexity - This conference started as "Structure in Complexity Theory" in 1986. It recently acquired the new name "Conference on Computational Complexity", which was used for the first time in 1996. CTI, DePaul University, Chicago IL; 18--21 June 2001.

Computability and Complexity - An online course on complexity.

Roberto Bayardo's Resources - Includes the relsat SAT solver and related papers.

Problem Solving Environments Home Page - This site contains information about Problem Solving Environments (PSEs), research, publications, and information on topics related to PSEs.

Hypercomputation Research Network - The study of computation beyond that defined by the Turing machine, also known as super-Turing, non-standard or non-recursive computation. Links to people, resources and discussions.

Blackbox - a SAT Technology Planning System - Blackbox is a planning system that works by converting problems specified in STRIPS notation into Boolean satisfiability problems, and then solving the problems with a variety of state-of-the-art satisfiability engines.

Computational Complexity and Statistical Physics - Santa Fe, New Mexico, USA; 4--6 September 2001.