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.

Roberto Bayardo's Resources
Includes the relsat SAT solver and related papers.

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.

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

Results: Previous 1 2 3 4 5

( Add Your Site )

» Advertising » Affiliate Program » Business » Computers » Construction » Consulting » Education » Entertainment » Financial Services » Food » Forum » Furniture » Gambling » Games » Garden » Graphic Design » Hardware » Health » Home » Human Resources » Internet » ISP » Law » Marketing » Mortgage

» Music » News » Others » Personal Site » Portal » Real Estate » Recreation » Search Engine Optimization » Security » Shopping » Society » Software » Sports » Telecommunications » Transportation » Travel » Web Design » Web Hosting Directory » Web Hosting Guide » Web Hosting Providers » Web Hosting Reviews » Web Marketing » Web Template » Webmaster Resources » World