Home    |Web Directory    |Metasearch    |Message Boards    |Classified Ads|

Web Directory

Home

Web Directory

Metasearch

Message Boards

Classified Ads

Your Ad Here
Your Ad Here

Top: Computers: Computer_Science: Theoretical: Complexity_Theory:

Complexity Theory (154)

Categories:

Sites:

http://www.nada.kth.se/~viggo/problemlist/compendium.html   » A Compendium of NP Optimization Problems Open in a new browser window
   This is a preliminary version of the catalog of NP optimization problems.
   http://www.nada.kth.se/~viggo/problemlist/compendium.html

http://www.almaden.ibm.com/cs/k53/algo.html   » Algorithms and Complexity Open in a new browser window
   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

http://web.comlab.ox.ac.uk/oucl/research/areas/algs/   » Algorithms and Complexity Research Area Open in a new browser window
   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/

http://www.uncg.edu/mat/avg.html   » Average-Case Complexity Forum Open in a new browser window
   Introduction and survey papers.
   http://www.uncg.edu/mat/avg.html

http://www.nlsde.buaa.edu.cn/~kexu/benchmarks/benchmarks.htm   » Challenging Benchmarks for SAT and CSP Open in a new browser window
   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/~kexu/benchmarks/benchmarks.htm

http://www.wisdom.weizmann.ac.il/~oded/cc.html   » Complexity Theory Open in a new browser window
   Two set of lecture notes by Prof. Oded Goldreich, Weizmann Institute.
   http://www.wisdom.weizmann.ac.il/~oded/cc.html

http://artemis.cs.yale.edu/classes/cs460/Spring98/contents.html   » Complexity of Algorithms Open in a new browser window
   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

http://www.csc.liv.ac.uk/~ped/teachadmin/algor/comput_complete.html   » Computability and Complexity Open in a new browser window
   An online course on complexity.
   http://www.csc.liv.ac.uk/~ped/teachadmin/algor/comput_complete.html

http://www.cs.umass.edu/~immerman/complexity_theory.html   » Computational Complexity Theory Open in a new browser window
   Definition of the subject, links.
   http://www.cs.umass.edu/~immerman/complexity_theory.html

http://www.cis.syr.edu/people/royer/talks.html   » Computational Complexity and Programming Languages Open in a new browser window
   Summaries of talks of the DIMACS workshop (July 1996), collected by James Royer.
   http://www.cis.syr.edu/people/royer/talks.html

http://web.comlab.ox.ac.uk/oucl/research/areas/constraints/index.html   » Constraint Satisfaction Problems Open in a new browser window
   Research group in the Computing Laboratory, Oxford University.
   http://web.comlab.ox.ac.uk/oucl/research/areas/constraints/index.html

http://www.eccc.uni-trier.de/eccc/   » ECCC - Electronic Colloquium on Computational Complexity Open in a new browser window
   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/

http://www.ibc-research.org/   » Information-based Complexity Open in a new browser window
   People, publications, prizes.
   http://www.ibc-research.org/

http://athos.rutgers.edu/~allender/lecture.notes/   » Lecture notes on Complexity Open in a new browser window
   Collection of lecture notes by Prof. Eric Allender, Rutgers University.
   http://athos.rutgers.edu/~allender/lecture.notes/

http://www.claymath.org/millennium/P_vs_NP/   » P vs NP Open in a new browser window
   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/

http://www.cs.mun.ca/~harold/W_hier/W_hier.html   » Parameterized Complexity Open in a new browser window
   Brief description, list of workers and problem compendium, compiled by Todd Wareham.
   http://www.cs.mun.ca/~harold/W_hier/W_hier.html

http://www-cse.ucsd.edu/users/mihir/pcp.html   » Probabilistically Checkable Proofs and Approximation Open in a new browser window
   Pointers to some survey articles and their authors, by M. Bellare.
   http://www-cse.ucsd.edu/users/mihir/pcp.html

http://www.satlive.org/   » SAT Live! Open in a new browser window
   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/

http://www.busygin.dp.ua/npc.html   » Stas Busygin's NP-Completeness Page Open in a new browser window
   A proposal for solving NP-hard problems.
   http://www.busygin.dp.ua/npc.html


This category needs an editor

Last Updated: 2006-10-06 08:24:59


Your Ad Here

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

The content of this directory is based on the Open Directory and has been modified by GoSearchFor.com

Free previews by Thumbshots.org