Complexity Theory
Home Page > Computers > Computer Science > Theoretical > Complexity Theory >


 
Subcategories found in Complexity Theory:
» Conferences» People» Publications
 

Web Sites
  • 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
     
  • 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/
     
  • Average-Case Complexity Forum
    Introduction and survey papers.
    http://www.uncg.edu/mat/avg.html
     
  • 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.
    http://www.nlsde.buaa.edu.cn/%7ekexu/benchmarks/benchmarks.htm
     
  • 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
     
  • Complexity Theory
    Two set of lecture notes by Prof. Oded Goldreich, Weizmann Institute.
    http://www.wisdom.weizmann.ac.il/~oded/cc.html
     
  • Computability and Complexity
    An online course on complexity.
    http://www.csc.liv.ac.uk/~ped/teachadmin/algor/comput_complete.html
     
  • Computational Complexity and Programming Languages
    Summaries of talks of the DIMACS workshop (July 1996), collected by James Royer.
    http://www.cis.syr.edu/people/royer/talks.html
     
  • Computational Complexity Theory
    Wikipedia article.
    http://en.wikipedia.org/wiki/Computational_complexity_theory
     
  • Computational Complexity Theory
    Definition of the subject, links.
    http://www.cs.umass.edu/~immerman/complexity_theory.html
     
  • Constraint Satisfaction Problems
    Research group in the Computing Laboratory, Oxford University.
    http://web.comlab.ox.ac.uk/oucl/research/areas/constraints/index.html
     
  • Information-based Complexity
    People, publications, prizes.
    http://www.ibc-research.org/
     
  • P vs NP
    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/
     
  • 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
     
  • 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
     
  • Stas Busygin's NP-Completeness Page
    A proposal for solving NP-hard problems.
    http://www.busygin.dp.ua/npc.html
     
  •  


    Complexity Theory

    Help build the largest human-edited directory on the web.
    Submit a Site - Open Directory Project - Become an Editor

    Modified by Submission.it
    Visit Our Network: Indicizzato.it - Posizionamento.com - Travel Directory - Business Directory
    Partner Sites: AccommodationZ.com - Accommodation in Venice - Accommodation in Rome - Greece Hotel Reservation - Hotels in Italy