- ECCC - Electronic Colloquium on Computational Complexity - http://www.eccc.uni-trier.de/eccc/
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.
- Roberto Bayardo's Resources - http://www.almaden.ibm.com/cs/people/bayardo/resources.html
Includes the relsat SAT solver and related papers.
- SAT Live! - http://www.satlive.org/
A collection of up-to-date links about the satisfiability problem (solvers, benchmarks, articles). A discussion forum is available as well.
- SATLIB - The Satisfiability Library - http://www.intellektik.informatik.tu-darmstadt.de/SATLIB/
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.
- Algorithms and Complexity - http://www-info4.informatik.uni-wuerzburg.de/personen/ehemalig/vollmer/tcs-bookmarks.html
A collection of bookmarks by Heribert Vollmer.
- Constraint Satisfaction Problems - http://web.comlab.ox.ac.uk/oucl/research/areas/constraints/index.html
Research group in the Computing Laboratory, Oxford University.
- Parameterized Complexity - http://www.cs.mun.ca/~harold/W_hier/W_hier.html
Brief description, list of workers and problem compendium, compiled by Todd Wareham.
- Algorithms and Complexity Research Area - http://web.comlab.ox.ac.uk/oucl/research/areas/algs/
The Oxford University Computing Laboratory's area on Algorithms and complexity, with links to lectures and information.
- Complexity of Algorithms - http://artemis.cs.yale.edu/classes/cs460/Spring98/contents.html
A list of topics from a Computer Science course involving complexity of algorithms. HTML and PS format.
- Algorithms and Complexity - http://www.almaden.ibm.com/cs/k53/algo.html
An overview of computational models and methods and how they relate to complexity, with links to selected papers.
- P vs NP - http://www.claymath.org/millennium/P_vs_NP/
Official version of the million dollar open problem in Theoretical Computer Science by the Clay Mathematical Institute.
- Complexity Theory - http://www.wisdom.weizmann.ac.il/~oded/cc.html
Two set of lecture notes by Prof. Oded Goldreich, Weizmann Institute.
- Lecture notes on Complexity - http://athos.rutgers.edu/~allender/lecture.notes/
Collection of lecture notes by Prof. Eric Allender, Rutgers University.
- Challenging Benchmarks for SAT and CSP - http://www.nlsde.buaa.edu.cn/%7ekexu/benchmarks/benchmarks.htm
Includes related links, references and a summary of the results for the SAT benchmarks used in SAT Competition 2004.
|
