Includes related links, references and a summary of the results
for the SAT benchmarks used in SAT Competition 2004.
www.cis.syr.edu/people/royer/talks.html
www-cse.ucsd
.edu/users/mihir/pcp.html
stas deterministic
www.almaden.ibm.com/cs/k53/algo.html
A collection of benchmark problems, solvers
, and tools.
heribert busygin
This is a preliminary version of the catalog of NP optimization problems.A collection of
bookmarks by Heribert Vollmer.Introduction and survey papers.An online course on complexity.
athos.rutgers
.edu/~allender/lecture.notes/
Parameterized Complexity
Stas Busygin`s NP-Completeness Page
goldreich completeness
HTML and PS
format.
Lecture notes on Complexity
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
.
royer wareham
A Compendium of NP Optimization Problems
www-info4.informatik.uni-wuerzburg.de/personen/ehemalig/vollmer
/tcs-bookmarks.html
Computability and Complexity
www.eccc.uni-trier.de/eccc/
Collection of lecture notes
by Prof.
deterministic wareham
www.uncg.edu/mat/avg.html
solvers royer
Complexity Theory
Constraint Satisfaction Problems
web.comlab.ox.ac.uk
/oucl/research/areas/constraints/index.html
A collection of up-to-date links about the satisfiability
problem (solvers, benchmarks, articles).
wareham csp
Two set of lecture notes by Prof. A discussion forum is available
as well.
solvers allender
Oded Goldreich, Weizmann Institute.A forum for the rapid and widespread interchange of ideas
, techniques, and research in computational complexity.
wareham colloquium
oded complexity
An overview of computational models and methods
and how they relate to complexity, with links to selected papers.Definition of the subject, links.
Research reports, surveys and books; meetings, discussions and web resources.
www.ibc-research.org/
oded busygin
Computational
Complexity Theory
Eric Allender, Rutgers University.
P vs NP
polynomial csp
www.nada.kth.se/~viggo/problemlist/compendium
.html
Computational Complexity Theory
Research group in the Computing Laboratory, Oxford University.
www
.cs.mun.ca/~harold/W_hier/W_hier.html
completeness colloquium
web.comlab.ox.ac.uk/oucl/research/areas/algs/
www.cs.umass.edu/~immerman
/complexity_theory.html
ECCC - Electronic Colloquium on Computational Complexity
weizmann goldreich
People, publications,
prizes.
Probabilistically Checkable Proofs and Approximation
computability benchmarks
www.claymath.org/millennium/P_vs_NP/
colloquium satisfiability
Pointers
to some survey articles and their authors, by M.
satisfiability wareham
Complexity of Algorithms
artemis.cs.yale.edu/classes
/cs460/Spring98/contents.html
Summaries of talks of the DIMACS workshop (July 1996), collected by James
Royer.
www.intellektik.informatik.tu-darmstadt.de/SATLIB/
www.busygin.dp.ua/npc.html
completeness polynomial
Information-based
Complexity
Bellare.
SAT Live!
SATLIB - The Satisfiability Library
heribert complexity
A list of topics from a Computer Science
course involving complexity of algorithms.
csp weizmann
www.wisdom.weizmann.ac.il/~oded/cc.html
Wikipedia article.
np polynomial
The Oxford University Computing Laboratory`s area on algorithms and complexity, with links to lectures
and information.
www.nlsde.buaa.edu.cn/%7ekexu/benchmarks/benchmarks.htm
benchmarks weizmann
Challenging Benchmarks for SAT
and CSP
www.csc.liv.ac.uk/~ped/teachadmin/algor/comput_complete.html
Brief description, list of workers
and problem compendium, compiled by Todd Wareham.
www.satlive.org/
stas csp
Algorithms and Complexity
Algorithms
and Complexity
Algorithms and Complexity Research Area
Average-Case Complexity Forum
en.wikipedia.org/wiki
/Computational_complexity_theory
Official version of the million dollar open problem in Theoretical Computer
Science by the Clay Mathematical Institute.A proposal for solving NP-hard problems.
benchmarks np
Computational Complexity
and Programming Languages
royer wareham
