AllMusicSearch Music Directory : Computers : Computer_Science : Theoretical : Complexity

Home
Music_Metasearch
Music Top Sites
Music Store

AllMusicListings
Concert Listings
Concert Tickets

AllMusicTalk
Chat Rooms
Message Boards

MusicNews
Pop Music News
Pop Music Reviews
Music Business
MP3 News

Community Blogs
Free Member Blogs

AllMusicPages
Free Web Pages

AllMusicBookmarks
Your Bookmarks

AllMusicFun
Musical Postcards
Relationship Test
Tarot Readings
Numerology

Music Auctions
Auctions
Classifieds

Music Apparel
AllMusicSearch Apparel

Music Store
MP3 Players
Audio Equipment
MP3 Software

Musical Instruments

Music Books
Music Magazines

Music T-Shirts

Alternative Rock
Blues
Broadway & Vocal
Children's
Christian & Gospel
Classic Rock
Classical
Country
Dance & DJ
Folk
Hard Rock & Metal
International
Jazz
Latin Music
Miscellaneous
New Age
Opera & Vocal
Pop
R&B
Rap & Hip-Hop
Rock
Soundtracks

Music Videos
Music DVDs

Suggest a site

Complexity Theory (147)

Categories:

Conferences (10)
People (111)
Publications (3)

Sites:

http://www.claymath.org/millennium/P_vs_NP/

» $1 million for solving P vs NP
One of the Prize Problems named by the Clay Mathematics Institute of Cambridge, Massachusetts (CMI).
http://www.claymath.org/millennium/P_vs_NP/

http://www.nada.kth.se/~viggo/problemlist/compendium.html

» 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

http://www.nlsde.buaa.edu.cn/~kexu/benchmarks/benchmarks.htm

» 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/~kexu/benchmarks/benchmarks.htm

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

http://qwiki.stanford.edu/wiki/Complexity_Zoo

» Complexity Zoo
Description of the 462 complexity classes and relations between them hosted at Caltech as a part of Qwiki project.
http://qwiki.stanford.edu/wiki/Complexity_Zoo

http://artemis.cs.yale.edu/classes/cs460/Spring98/contents.html

» 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

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

http://www.cs.bris.ac.uk/Teaching/Resources/COMS30126/

» Computational Complexity Theory
Course COMS 30126: Computational Complexity Theory, Department of Computer Science, University of Bristol
http://www.cs.bris.ac.uk/Teaching/Resources/COMS30126/

http://www.cis.syr.edu/people/royer/talks.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

http://www.comlab.ox.ac.uk/activities/constraints/

» Constraint Satisfaction Problems
Research group in the Computing Laboratory, Oxford University.
http://www.comlab.ox.ac.uk/activities/constraints/

» 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://eccc.hpi-web.de/

http://www-inst.eecs.berkeley.edu/~cs170/fa06/

» Efficient algorithms and intractable problems
Course taught by Christos Papadimitriou and Umesh Vazirani at the University of California at Berkeley.
http://www-inst.eecs.berkeley.edu/~cs170/fa06/

http://domino.research.ibm.com/comm/research.nsf/pages/r.algorithms.html

» IBM Research: Algorithms & Theory
An overview of computational models and methods and how they relate to complexity, with links to selected papers.
http://domino.research.ibm.com/comm/research.nsf/pages/r.algorithms.html

» Information-based Complexity
People, publications, prizes.
http://www.ibc-research.org/

http://www.cs.rutgers.edu/~allender/lecture.notes/

» Lecture notes on Complexity
Collection of lecture notes by Prof. Eric Allender, Rutgers University.
http://www.cs.rutgers.edu/~allender/lecture.notes/

http://www.cs.mun.ca/~harold/W_hier/W_hier.html

» 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

http://www-cse.ucsd.edu/users/mihir/pcp.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

» 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/

» 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.satlib.org/

http://hagaregn.org.uk/npsudoku/index.html

» The NP-Complete Arcade
Provides applets that can be used to explore the conditions under which some well-known NP-complete problems become hard.
http://hagaregn.org.uk/npsudoku/index.html

http://www.thi.uni-hannover.de/en/research/links/

» Theoretical Computer Science links
A collection of bookmarks to algorithms and complexity resources maintained by Heribert Vollmer at the Theoretical Computer Science Institute, University of Hannover.
http://www.thi.uni-hannover.de/en/research/links/

This category needs an editor

Last Updated: 2007-01-02 19:58:46

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 AllMusicSearch.com editors