Top : Computers : Computer Science : Theoretical :
Complexity Theory
Categories
| Conferences People Publications |
Websites
Introduction and survey papers.
http://www.uncg.edu/mat/avg.html
This is a preliminary version of the catalog of NP optimization problems.
http://www.nada.kth.se/~viggo/problemlist/compendium.html
Includes the relsat SAT solver and related papers.
http://www.almaden.ibm.com/cs/people/bayardo/resources.html
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/
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.
http://www.intellektik.informatik.tu-darmstadt.de/SATLIB/
A proposal for solving NP-hard problems.
http://www.busygin.dp.ua/npc.html
An online course on complexity.
site exerpt
The final part of the course deals with the issue of assessing how difficult specific computational problems are to solve. Given a description of a particular problem a number of questions arise: Is it possible to design an algorithm which...People, publications, prizes.
http://www.ibc-research.org/
A collection of bookmarks by Heribert Vollmer.
http://www-info4.informatik.uni-...malig/vollmer/tcs-bookmarks.html
Research group in the Computing Laboratory, Oxford University.
http://web.comlab.ox.ac.uk/oucl/...rch/areas/constraints/index.html
Brief description, list of workers and problem compendium, compiled by Todd Wareham.
http://www.cs.mun.ca/~harold/W_hier/W_hier.html
Pointers to some survey articles and their authors, by M. Bellare.
http://www-cse.ucsd.edu/users/mihir/pcp.html
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/
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
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
Wikipedia article.
http://en.wikipedia.org/wiki/Computational_complexity_theory
Summaries of talks of the DIMACS workshop (July 1996), collected by James Royer.
http://www.cis.syr.edu/people/royer/talks.html
Definition of the subject, links.
http://www.cs.umass.edu/~immerman/complexity_theory.html
Official version of the million dollar open problem in Theoretical Computer Science by the Clay Mathematical Institute.
http://www.claymath.org/millennium/P_vs_NP/
Two set of lecture notes by Prof. Oded Goldreich, Weizmann Institute.
http://www.wisdom.weizmann.ac.il/~oded/cc.html
Collection of lecture notes by Prof. Eric Allender, Rutgers University.
http://athos.rutgers.edu/~allender/lecture.notes/
Includes related links, references and a summary of the results for the SAT benchmarks used in SAT Competition 2004.
http://www.nlsde.buaa.edu.cn/%7ekexu/benchmarks/benchmarks.htm
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.
site exerpt
ECCC The Electronic Colloquium on Computational Complexity Last year we celebrated the 10th anniversary of ECCC. ECCC Reports Browse: 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996 1995 1994 SearchArchive CDs Special offer: 10-years-celebration CD ECCC Books, Lectures and Surveys Monographs Lecture Notes Online Lectures...