Actimania web directory of carefully selected sites

Arts

Business

Computers

Games

Health

Home

Teens

News

Recreation

Reference

Regional

Science

Shopping

Looking for a directory of carefully selected sites in Computers, Computer Science, Theoretical, Complexity Theory ? Actimania, based on the largest, most comprehensive human-edited directory of the web, covers a large variety of annotated sites related to Computers, Computer Science, Theoretical, Complexity Theory. This category lists wide range of carefully selected sites in Computers, Computer Science, Theoretical, Complexity Theory.

Hotels Galaxy - Hotels all around the world. Discount hotels, hotel rates and lodging reservation. Hotels reservations, flights, cars, travel, vacations, cruises.
OOHotels - Discount and cheap hotels worldwide. Hotel rates and lodging reservations at cheap prices.
OOVacances - Vacations in France - Vacations and Holidays in France. Vacation Rentals of Private Villas, cottages, cabins, apartments and condos.

http://web.comlab.ox.ac.uk/oucl/research/areas/algs/

» Algorithms and Complexity Research Area - The Oxford University Computing Laboratory's area on algorithms and complexity, with links to lectures and information.

http://ocw.mit.edu/OcwWeb/Electrical-Engineering-and-Computer-Science/6-045JSpring-2005/CourseHome/index.htm

» Automata, Computability, and Complexity, Spring 2005 - Course 6.045J / 18.400J at MIT OpenCourseWare with introduction to basic mathematical models of computation, Turing machines, Church's Thesis, time complexity and NP-completeness.

» Average-Case Complexity Forum - Introduction and survey papers.

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.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://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://www.wisdom.weizmann.ac.il/~oded/cc.html

» Complexity Theory - Two set of lecture notes by Prof. Oded Goldreich, Weizmann Institute.

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://www.csc.liv.ac.uk/~ped/teachadmin/algor/comput_complete.html

» Computability and Complexity - An online course on complexity.

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.cs.umass.edu/~immerman/complexity_theory.html

» Computational Complexity Theory - Definition of the subject, links.

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://en.wikipedia.org/wiki/Computational_complexity_theory

» Computational Complexity Theory - Wikipedia article.

http://web.comlab.ox.ac.uk/oucl/research/areas/constraints/index.html

» Constraint Satisfaction Problems - Research group in the Computing Laboratory, Oxford University.

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

» Information-based Complexity - People, publications, prizes.

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

» Lecture notes on Complexity - Collection of lecture notes by Prof. Eric Allender, Rutgers University.

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

» Probabilistically Checkable Proofs and Approximation - Pointers to some survey articles and their authors, by M. Bellare.

» SAT Live! - A collection of up-to-date links about the satisfiability problem (solvers, benchmarks, articles). A discussion forum is available as well.

» 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.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://ocw.mit.edu/OcwWeb/Mathematics/18-404JFall-2006/CourseHome/

» Theory of Computation, Fall 2006 - Course 6.045J/18.400J at MIT OpenCourseWare, emphasizing computability and computational complexity theory.

This page of directory is focused on one aspect of Computers, Computer Science, Theoretical, Complexity Theory.

Help build the largest human-edited directory on the web. Soumettre un site - Open Directory Project - Devenir Editeur

Actimania web directory list the sites by theme. The links in Actimania directory are collected, edited and organized by humans.