Back to Results
First PageMeta Content
Complexity classes / Computational resources / Mathematical optimization / Structural complexity theory / Advice / NTIME / Probabilistically checkable proof / NP / P versus NP problem / Theoretical computer science / Computational complexity theory / Applied mathematics


Improving Exhaustive Search Implies Superpolynomial Lower Bounds Ryan Williams∗ IBM Almaden Research Center May 4, 2010
Add to Reading List

Document Date: 2010-05-04 16:48:34

Open Document

File Size: 271,94 KB

Share Result on Facebook

City

Princeton / /

Company

IBM / 3SAT / CNF / /

IndustryTerm

faster algorithms / desired above algorithms / deterministic n2 algorithm / subexponential algorithms / hardware/software / brute-force search / stronger improved algorithms / polynomial time algorithm / nondeterministic algorithm / brute force search / improved exponential algorithms / nondeterministic polynomial time algorithm / deterministic algorithm / generic search problems / nondeterministic algorithms / possible solutions / short verifiable solutions / exhaustive search / search space / nondeterministic approximation algorithm / trivial algorithm / nondeterministic 2n time algorithm / search problems / decent uniform algorithms / /

OperatingSystem

XP / /

Organization

National Science Foundation / Institute for Advanced Study / Improving Exhaustive Search Implies Superpolynomial Lower Bounds Ryan Williams∗ IBM Almaden Research Center / /

Person

Mike Fellows / Chen / Lipton / Francis Zane / Santhanam / Cai / Van Melkebeek / Karp / /

Position

author / Fisher / /

ProvinceOrState

New Jersey / /

Technology

improved CAPP algorithm / decent uniform algorithms / randomized algorithm / nondeterministic approximation algorithm / polynomial time algorithm / improved exponential algorithms / desired above algorithms / randomized SAT algorithm / time algorithm / trivial algorithm / nondeterministic algorithm / deterministic algorithm / deterministic n2 algorithm / stronger improved algorithms / 1.1 Improved Algorithms / subexponential time algorithms / 1.2 Improved Algorithms / faster SAT algorithms / nondeterministic polynomial time algorithm / random access / simulation / CAPP algorithm / 3 Improved Algorithms / SAT algorithms / improved algorithms / IRCUIT SAT algorithms / nondeterministic 2n time algorithm / /

SocialTag