Complexity Theory (Theoretical)

Complexity Theory further on these related pages:

Conferences People Publications

Complexity Theory Sites:

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