Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies

Lecture Notes in Computer Science - Germany
doi 10.1007/11786986_29
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Exponential Lower Bounds and Integrality Gaps for Tree-Like Lovász-Schrijver Procedures

2009English

Graph Expansion, Tseitin Formulas and Resolution Proofs for CSP

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Short Proofs of the Kneser-Lovász Coloring Principle

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2018English

A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
2003English

Constructive Proofs of Concentration Bounds

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Calculus Proofs of Some Combinatorial Inequalities

Mathematical Inequalities and Applications
MathematicsApplied Mathematics
2003English

Computing Bounds From Arithmetical Proofs

English

Lower Bounds

2016English

Lower Bounds for Subgraph Isomorphism

2019English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy