Sponsored Links
Directory Sites
A Compendium of NP Optimization Problems
This is a preliminary version of the catalog of NP optimization problems.
www.nada.kth.se
A collection of up-to-date links about the satisfiability problem (solvers, benchmarks, articles). A discussion forum is available as well.
www.satlive.org
Stas Busygin's NP-Completeness Page
A proposal for solving NP-hard problems.
www.busygin.dp.ua
An online course on complexity.
www.csc.liv.ac.uk
People, publications, prizes.
www.ibc-research.org
Constraint Satisfaction Problems
Research group in the Computing Laboratory, Oxford University.
web.comlab.ox.ac.uk
Brief description, list of workers and problem compendium, compiled by Todd Wareham.
www.cs.mun.ca
Probabilistically Checkable Proofs and Approximation
Pointers to some survey articles and their authors, by M. Bellare.
www-cse.ucsd.edu
Algorithms and Complexity Research Area
The Oxford University Computing Laboratory's area on algorithms and complexity, with links to lectures and information.
web.comlab.ox.ac.uk
A list of topics from a Computer Science course involving complexity of algorithms. HTML and PS format.
artemis.cs.yale.edu
Computational Complexity Theory
Wikipedia article.
en.wikipedia.org
Computational Complexity and Programming Languages
Summaries of talks of the DIMACS workshop (July 1996), collected by James Royer.
www.cis.syr.edu
Computational Complexity Theory
Definition of the subject, links.
www.cs.umass.edu
Official version of the million dollar open problem in Theoretical Computer Science by the Clay Mathematical Institute.
www.claymath.org
Two set of lecture notes by Prof. Oded Goldreich, Weizmann Institute.
www.wisdom.weizmann.ac.il