|
|
|
|
Home / Computers / Algorithms / Complexity
|
|
|
|
Web Sites
|
- A Compendium of NP Optimization Problems - This is a preliminary version of the catalog of NP optimization problems.
www.nada.kth.se/~viggo/problemlist/compendium.html
- Algorithms and Complexity - A collection of bookmarks by Heribert Vollmer.
www-info4.informatik.uni-wuerzburg.de/personen/ehemalig/vollmer/tcs-bookmarks.html
- Average-Case Complexity Forum - Introduction and survey papers.
www.uncg.edu/mat/avg.html
- 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.
www.cs.washington.edu/homes/kautz/blackbox
- 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.
www.nada.kth.se/~viggo/approxbook
- Computability and Complexity - An online course on complexity.
www.csc.liv.ac.uk/~ped/teachadmin/algor/comput_complete.html
- Computational Complexity - (Birkhäuser) Tables of contents from vol.7 (1998) on. Full text to subscribers via LINK.
link.springer-ny.com/link/service/journals/00037
- Computational Complexity and Programming Languages - Summaries of talks of the DIMACS workshop (July 1996), collected by James Royer.
top.cis.syr.edu/people/royer/talks.html
- Constraint Satisfaction Problems - Research group in the Computing Laboratory, Oxford University.
web.comlab.ox.ac.uk/oucl/research/areas/constraints/index.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.
www.eccc.uni-trier.de/eccc
- Hypertext Bibliography of Measures of Complexity - Bruce Edmonds; Manchester Metropolitan University.
bruce.edmonds.name/combib
- Information-based Complexity - People, publications, prizes.
www.ibc-research.org
- Parameterized Complexity - Brief description, list of workers and problem compendium, compiled by Todd Wareham.
www.cs.mun.ca/~harold/W_hier/W_hier.html
- Probabilistically Checkable Proofs and Approximation - Pointers to some survey articles and their authors, by M. Bellare.
www-cse.ucsd.edu/users/mihir/pcp.html
- Roberto Bayardo's Resources - Includes the relsat SAT solver and related papers.
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.
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.
www.intellektik.informatik.tu-darmstadt.de/SATLIB
- Stas Busygin's NP-Completeness Page - A proposal for solving NP-hard problems.
www.busygin.dp.ua/npc.html
- The P versus NP Problem - Description of the P vs NP question, designated a Clay Mathematics Institute Millennium Prize Problems, by Stephen Cook.
www.claymath.org/prize_problems/p_vs_np.htm
|
|
|
|
|