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 / /