| LTN |
Complexity Theory: The study of algorithmic complexity. A topic of particular interest is the relationship between polynomial-time (P) and non-deterministic polynomial-time (NP) - the latter consisting of algorithms for which there is a P solution given the right initial guess (often called witness or certificate). Computer Science Theoretical Complexity Theory:
 A Compendium of NP Optimization ProblemsComputers: A Compendium, Theoretical Complexity Theory This is a preliminary version of the catalog of NP optimization problems of NP Optimization Problems . Complexity Theory - Complexity TheoryComputers: Complexity, Theoretical Complexity Theory Two set of lecture notes by Prof Theory Complexity Theory Oded Goldreich, Weizmann Institute. P vs NP - Complexity TheoryComputers: P vs, Theoretical Complexity Theory Official version of the million dollar open problem in Theoretical Computer Science by the Clay Mathematical Institute NP Complexity Theory . ECCC - Electronic Colloquium on Computational ComplexityComputers: ECCC, Theoretical Complexity Theory A forum for the rapid and widespread interchange of ideas Electronic Colloquium on Computational Complexity techniques, and research in computational complexity. Research reports, surveys and books; meetings, discussions and web resources. Computational Complexity Theory - Complexity TheoryComputers: Computational, Theoretical Complexity Theory Wikipedia article Complexity Theory Complexity Theory . Constraint Satisfaction ProblemsComputers: Constraint, Theoretical Complexity Theory Research group in the Computing Laboratory Satisfaction Problems Oxford University. Lecture notes on Complexity - Complexity TheoryComputers: Lecture, Theoretical Complexity Theory Collection of lecture notes by Prof notes on Complexity Complexity Theory Eric Allender, Rutgers University. SAT Live!Computers: SAT Live!, Theoretical Complexity Theory A collection of up-to-date links about the satisfiability problem SAT Live! solvers, benchmarks, articles,. A discussion forum is available as well. Algorithms and Complexity Research AreaComputers: Algorithms, Theoretical Complexity Theory The Oxford University Computing Laboratory's area on Algorithms and complexity and Complexity Research Area with links to lectures and information. Probabilistically Checkable Proofs and ApproximationComputers: Probabilistically, Theoretical Complexity Theory Pointers to some survey articles and their authors Checkable Proofs and Approximation by M. Bellare. Algorithms and Complexity - Complexity TheoryComputers: Algorithms, Theoretical Complexity Theory A collection of bookmarks by Heribert Vollmer and Complexity Complexity Theory . Information-based ComplexityComputers: Information-based, Theoretical Complexity Theory People Complexity publications, prizes. Parameterized ComplexityComputers: Parameterized, Theoretical Complexity Theory Brief description Complexity list of workers and problem compendium, compiled by Todd Wareham. SATLIB - The Satisfiability LibraryComputers: SATLIB, Theoretical Complexity Theory A collection of benchmark problems The Satisfiability Library 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. Algorithms and ComplexityComputers: Algorithms, Theoretical Complexity Theory An overview of computational models and methods and how they relate to complexity and Complexity with links to selected papers. International Workshop on Implicit Computation ComplexityComputers: International, Theoretical Complexity Theory · Webpages of past and forthcoming ICC conferences and related meetings Workshop on Implicit Computation Complexity Next meeting as a satellite workshop of LICS'03: Ottawa, Canada; 26--27 June 2003. Conferences of Interest for Complexity PeopleComputers: Conferences, Theoretical Complexity Theory · Maintained at the Electronic Colloquium on Computational Complexity of Interest for Complexity People . Bollig, Beate - Complexity TheoryComputers: Bollig, Theoretical Complexity Theory · University of Dortmund Beate Complexity Theory . Waack, StephanComputers: Waack, Theoretical Complexity Theory · Universität Göttingen Stephan . Complexity and ApproximationComputers: Complexity, Theoretical Complexity Theory · Combinatorial optimization problems and their approximability properties: by G and Approximation 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. BEATCS Computational Complexity ColumnComputers: BEATCS, Theoretical Complexity Theory · Bulletin of the European Association for Theoretical Computer Science Computational Complexity Column Editor Lance Fortnow. Articles in PS/PDF. An Introduction to the Theory of Computation - Complexity TheoryComputer Science Theoretical - An online text aimed at advanced undergraduate and graduate students to the Theory of Computation Complexity Theory . Theoretical Computer Science on the WebComputer Science Theoretical - A directory of resources related to theoretical computer science from Stanford University Computer Science on the Web . Church-Turing Thesis - Complexity TheoryComputer Science Theoretical - Wikipedia article Thesis Complexity Theory . Interactive Computation - Complexity TheoryComputer Science Theoretical - Wikipedia article Computation Complexity Theory . Computability Logic - Complexity TheoryComputer Science Theoretical - Main web source on the subject: overview Logic Complexity Theory downloadable articles, links. | |||||||||
