Dantchev, S. (2007) 'Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems.', in STOC '07 : proceedings of the 39th Annual ACM Symposium on Theory of Computing : San Diego, California, USA, June 11-13, 2007. New York: Association for Computing Machinery, pp. 311-317. ACM Symposium on Theory of Computing.
We prove a dichotomy theorem for the rank of the uniformly generated(i.e. expressible in First-Order (FO) Logic) propositional tautologiesin both the Lovász-Schrijver (LS) and Sherali-Adams (SA) proofsystems. More precisely, we first show that the propositional translationsof FO formulae that are universally true, i.e. hold in all finiteand infinite models, have LS proofs whose rank is constant, independentlyfrom the size of the (finite) universe. In contrast to that, we provethat the propositional formulae that hold in all finite models butfail in some infinite structure require proofs whose SA rank grows poly-logarithmically with the size of the universe. Up to now, this kind of so-called "Complexity Gap" theorems have been known for Tree-like Resolution and, in somehow restrictedforms, for the Resolution and Nullstellensatz proof systems. As faras we are aware, this is the first time the Sherali-Adams lift-and-projectmethod has been considered as a propositional proof system. An interesting feature of the SA proof system is that it is static and rank-preserving simulates LS, the Lovász-Schrijver proof system without semidefinitecuts.
|Item Type:||Book chapter|
|Full text:||Full text not available from this repository.|
|Publisher Web site:||https://doi.org/10.1145/1250790.1250837|
|Record Created:||23 Jan 2009|
|Last Modified:||28 Jun 2017 11:44|
|Social bookmarking:||Export: EndNote, Zotero | BibTex|
|Look up in GoogleScholar | Find in a UK Library|