Complexity Theory - Twitter Search

doing some recursive time functions and studying complexity theory.
hasipeter (Hasi) Tue, 03 Nov 2009 17:06:07 -0000
doing some recursive time functions and studying complexity theory.
@hakmem Ican give you a definition in the content of quantum complexity theory of that' s what you mean
doxaras (doxaras) Tue, 03 Nov 2009 12:25:34 -0000
@hakmem Ican give you a definition in the content of quantum complexity theory of that' s what you mean
Great chat over dinner with Danish biologist now working in FM, rambled thru gaia, resilience, complexity theory, biomicry, edge of chaos +
fairsnape (martin brown) Mon, 02 Nov 2009 22:01:20 -0000
Great chat over dinner with Danish biologist now working in FM, rambled thru gaia, resilience, complexity theory, biomicry, edge of chaos +
How can complexity theory contribute to more effective development and aid evaluation? http://bit.ly/3tlpN5
arjencito (Arjen Mulder) Mon, 02 Nov 2009 21:56:56 -0000
How can complexity theory contribute to more effective development and aid evaluation? http://bit.ly/3tlpN5
@fortnow "Communication with the dead" implies P=NP? Just another "if pigs can fly then horses can whistle" result in complexity theory....
rrwilliams (R. Ryan Williams) Mon, 02 Nov 2009 19:06:53 -0000
@fortnow "Communication with the dead" implies P=NP? Just another "if pigs can fly then horses can whistle" result in complexity theory....
A summary of the meeting we hosted on complexity theory (w/ relationship to HIV and AIDs) is online now http://www.panos.org.uk/?lid=29888
PanosLondonAIDS (Panos London AIDS) Mon, 02 Nov 2009 09:48:24 -0000
A summary of the meeting we hosted on complexity theory (w/ relationship to HIV and AIDs) is online now http://www.panos.org.uk/?lid=29888

 

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)