Access this bibliographic database via BibTeX, .PDF, or PostScript file. Maintained by Peter Cholak.

Extensive document discusses the difficulty of solving specific computational problems and includes instruction on comparing algorithms.

Find explanatory material for hypercomputation, a study of computation beyond that defined by the Turing machine. With a bibliography and a list of active researchers.

Features a list of topics covered in its conferences including algebraic complexity, cryptographic complexity, and reducibility. Get info on upcoming events.

Clay Mathematics Institute gives a full-length description of the P versus NP problem in .PDF format. Learn about other Millennium prize problems.

Offers an explanation of this type of computer system and includes related research, publications, and links to projects and products.

Access this updated collection of links for the SATisfiability Problem. With a list of recent entries and descriptions, discussions, software, and benchmarks.

Gives an intro to solving NP problems and talks about related technology, software, and papers. Download an Efficient Algorithm for the Minimum Clique Partition Problem.