Complexity Theory - Google News

Emergent Complexity Theory and the Anarchist Approach - Infoshop News
Thu, 08 May 2008 03:34:24 -0000
Emergent Complexity Theory and the Anarchist ApproachInfoshop News - May 7, 2008Emergent Complexity answers questions arising in nature, such as: How do the facile actions of individuals accumulate to form the complex behavior of groups ...
Intelligent Design is not a theory - Westseattleherald.com
Sun, 11 May 2008 23:54:28 -0000
Intelligent Design is not a theoryWestseattleherald.com, WA - May 11, 2008As for your claims about support from probability and information theory, I will note that Dembski's book exhibits grevious ignorance of formal Complexity ...Intelligent Design is not a theory Westseattleherald.comIntelligent Design is a fact Westseattleherald.comall 3 news articles
Career possibilities in cryptology - Times of India
Mon, 19 May 2008 00:24:30 -0000
Career possibilities in cryptologyTimes of India, India - May 18, 2008... etc and also computer science topics such as algorithms, hardware interfaces and other areas including image processing, complexity theory, and so on. ...
DHS report: Open source code "quality" is up - SC Magazine US
Tue, 20 May 2008 20:00:59 -0000
DHS report: Open source code "quality" is upSC Magazine US - 5 hours agoThe research also indicates that cyclomatic complexity, a metric used to measure the complexity of a program, and Halstead effort of code complexity are ...
Nature creates an earthy layer cake - Times and Transcript
Tue, 20 May 2008 09:12:01 -0000
Nature creates an earthy layer cakeTimes and Transcript, Canada - 16 hours agoOne of the reasons is the intricate and fluctuating complexity of melt patterns fashioned by grime in sequential dumps; elaborate frosty dirtcicles and ...
Why we buy what we buy - guardian.co.uk
Mon, 19 May 2008 23:16:37 -0000
Why we buy what we buyguardian.co.uk, UK - May 19, 2008What Ariely's jam study suggests is that, contrary to economic belief that more choice is better, confronted with too much complexity, we make bad decisions ...

 

Subscribe to Complexity_Theory RSS feed

A Compendium of NP Optimization Problems - This is a preliminary version of the catalog of NP optimization problems.
Meta Description: [ A compendium of NP optimization problems ]

404 Algorithms and Complexity - A collection of bookmarks by Heribert Vollmer.

Algorithms and Complexity - An overview of computational models and methods and how they relate to complexity, with links to selected papers.
Meta Description: [ IBM Almaden Research Center | DESCRIPTION ]

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

Average-Case Complexity Forum - Introduction and survey papers.

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.
Meta Description: [ Forced Satisfiable CSP and SAT Benchmarks of Model RB ]

Complexity of Algorithms - A list of topics from a Computer Science course involving complexity of algorithms. HTML and PS format.

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

Computability and Complexity - An online course on complexity.

Computational Complexity and Programming Languages - Summaries of talks of the DIMACS workshop (July 1996), collected by James Royer.

Computational Complexity Theory - Wikipedia article.

Computational Complexity Theory - Definition of the subject, links.

Constraint Satisfaction Problems - Research group in the Computing Laboratory, Oxford University.
Meta Description: [ Oxford University Constraint Satisfaction Research Group ]

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.
Meta Description: [ Homepage of the Electronic Colloquium on Computational Complexity located at the University of Trier, Germany ]

Information-based Complexity - People, publications, prizes.

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

P vs NP - Official version of the million dollar open problem in Theoretical Computer Science by the Clay Mathematical Institute.

Parameterized Complexity - Brief description, list of workers and problem compendium, compiled by Todd Wareham.

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

404 Roberto Bayardo's Resources - Includes the relsat SAT solver and related papers.
Meta Description: [ IBM Research main home page ]

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

404 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.

Stas Busygin's NP-Completeness Page - A proposal for solving NP-hard problems.

Advice is a concept in complexity theory. An advice string is an extra input to a Turing machine which is allowed to depend on the length n of the input, but not on input itself. A decision problem is in the complexity class P/f(n) if there is a polynomial time Turing machine M with the following property: for any n, there is an advice string A of length f(n) such that, for any input x of length n, the machine M correctly decides the problem on the input x, given x and A. (more)