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.

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

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.