Alternation-Trading Proofs, Linear Programming, and Lower Bounds - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

Alternation-Trading Proofs, Linear Programming, and Lower Bounds

Ryan Williams
  • Function : Author
  • PersonId : 867204


A fertile area of recent research has demonstrated concrete polynomial time lower bounds for solving natural hard problems on restricted computational models. Among these problems are Satisfiability, Vertex Cover, Hamilton Path, Mod6-SAT, Majority-of-Majority-SAT, and Tautologies, to name a few. The proofs of these lower bounds follow a certain proof-by-contradiction strategy that we call alternation-trading. An important open problem is to determine how powerful such proofs can possibly be. We propose a methodology for studying these proofs that makes them amenable to both formal analysis and automated theorem proving. We prove that the search for better lower bounds can often be turned into a problem of solving a large series of linear programming instances. Implementing a small-scale theorem prover based on this result, we extract new human-readable time lower bounds for several problems. This framework can also be used to prove concrete limitations on the current techniques.
Fichier principal
Vignette du fichier
williams.pdf (224.87 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00456011 , version 1 (11-02-2010)


  • HAL Id : inria-00456011 , version 1


Ryan Williams. Alternation-Trading Proofs, Linear Programming, and Lower Bounds. 27th International Symposium on Theoretical Aspects of Computer Science - STACS 2010, Inria Nancy Grand Est & Loria, Mar 2010, Nancy, France. pp.669-680. ⟨inria-00456011⟩


53 View
198 Download


Gmail Facebook X LinkedIn More