Directory > Computers > Algorithms > Complexity Introduction to Computational Complexity Theory First read for a Complexity enthusiast. A detailed introduction to Computational Complexity. http://en.wikipedia.org/wiki/Computational_complexity_theory Reviews Rating: Not yet Rated
Whois Check
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 Reviews Rating: Not yet Rated
Whois Check
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 Reviews Rating: Not yet Rated
Whois Check
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/ Reviews Rating: Not yet Rated
Whois Check
Probabilistically Checkable Proofs and Approximation Pointers to some survey articles and their authors, by M. Bellare. http://www-cse.ucsd.edu/users/mihir/pcp.html Reviews Rating: Not yet Rated
Whois Check
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 Reviews Rating: Not yet Rated
Whois Check
Constraint Satisfaction Problems Research group in the Computing Laboratory, Oxford University. http://web.comlab.ox.ac.uk/oucl/research/areas/constraints/index.html Reviews Rating: Not yet Rated
Whois Check
Computational Complexity and Programming Languages Summaries of talks of the DIMACS workshop (July 1996), collected by James Royer. http://top.cis.syr.edu/people/royer/talks.html Reviews Rating: Not yet Rated
Whois Check
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/ Reviews Rating: Not yet Rated
Whois Check
Hypertext Bibliography of Measures of Complexity Bruce Edmonds; Manchester Metropolitan University. http://bruce.edmonds.name/combib/ Reviews Rating: Not yet Rated
Whois Check
Algorithms and Complexity A collection of bookmarks by Heribert Vollmer. http://www-info4.informatik.uni-wuerzburg.de/personen/ehemalig/vollmer/tcs-bookmarks.html Reviews Rating: Not yet Rated
Whois Check
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/ Reviews Rating: Not yet Rated
Whois Check
Information-based Complexity People, publications, prizes. http://www.ibc-research.org/ Reviews Rating: Not yet Rated
Whois Check
Computability and Complexity An online course on complexity. http://www.csc.liv.ac.uk/~ped/teachadmin/algor/comput_complete.html Reviews Rating: Not yet Rated
Whois Check
Stas Busygin's NP-Completeness Page A proposal for solving NP-hard problems. http://www.busygin.dp.ua/npc.html Reviews Rating: Not yet Rated
Whois Check
SATLIB - The Satisfiability Library 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/ Reviews Rating: Not yet Rated
Whois Check
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/ Reviews Rating: Not yet Rated
Whois Check
Roberto Bayardo's Resources Includes the relsat SAT solver and related papers. http://www.almaden.ibm.com/cs/people/bayardo/resources.html Reviews Rating: Not yet Rated
Whois Check
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/ Reviews Rating: Not yet Rated
Whois Check
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 Reviews Rating: Not yet Rated
Whois Check
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 Reviews Rating: Not yet Rated
Whois Check
Average-Case Complexity Forum Introduction and survey papers. http://www.uncg.edu/mat/avg.html Reviews Rating: Not yet Rated
Whois Check
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/ Reviews Rating: Not yet Rated
Whois Check
|