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.
http://www.cs.washington.edu/homes/kautz/blackbox/
The P versus NP Problem:
Description of the P vs NP question, designated a Clay Mathematics
Institute Millennium Prize Problems, by Stephen Cook.
http://www.claymath.org/prize_problems/p_vs_np.htm
A Compendium of NP Optimization Problems:
This is a preliminary version of the catalog of NP optimization
problems.
http://www.nada.kth.se/~viggo/problemlist/compendium.html
ECCC - Electronic Colloquium on Computational Complexity:
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.
http://www.eccc.uni-trier.de/eccc/
Roberto Bayardo's Resources:
Includes the relsat SAT solver and related papers.
http://www.almaden.ibm.com/cs/people/bayardo/resources.html
SAT Live!:
A collection of up-to-date links about the satisfiability problem
(solvers, benchmarks, articles). A discussion forum is available as
well.
http://www.satlive.org/
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.
http://www.intellektik.informatik.tu-darmstadt.de/SATLIB/
Computational Complexity:
(Birkhأ¤user) Tables of contents from vol.7 (1998) on. Full text to
subscribers via LINK.
http://link.springer-ny.com/link/service/journals/00037/
Algorithms and Complexity:
A collection of bookmarks by Heribert Vollmer.
http://www-info4.informatik.uni-wuerzburg.de/personen/ehemalig/vollmer/tcs-bookmarks.html
Complexity and Approximation:
Combinatorial optimization problems and their approximability
properties: by G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A.
Marchetti-Spaccamela, M. Protasi (Springer, 1999). Table of
contents, errata, software supplement and a continuously updated
catalog of approximability results.
http://www.nada.kth.se/~viggo/approxbook/
Constraint Satisfaction Problems:
Research group in the Computing Laboratory, Oxford University.
http://web.comlab.ox.ac.uk/oucl/research/areas/constraints/index.html
Parameterized Complexity:
Brief description, list of workers and problem compendium, compiled
by Todd Wareham.
http://www.cs.mun.ca/~harold/W_hier/W_hier.html
Algorithms and Complexity Research Area:
The Oxford University Computing Laboratory's area on Algorithms and
complexity, with links to lectures and information.
http://web.comlab.ox.ac.uk/oucl/research/areas/algs/
Complexity of Algorithms:
A list of topics from a Computer Science course involving complexity
of algorithms. HTML and PS format.
http://artemis.cs.yale.edu/classes/cs460/Spring98/contents.html
Algorithms and Complexity:
An overview of computational models and methods and how they relate
to complexity, with links to selected papers.
http://www.almaden.ibm.com/cs/k53/algo.html
