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

doi 10.1137/1.9781611973068.40
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

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

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Improved Lower Bounds for Tree-Like Resolution Over Linear Inequalities

English

Exponential Lower Bounds for the Pigeonhole Principle

1992English

On Lower Bounds of Exponential Frames

Journal of Fourier Analysis and Applications
MathematicsApplied MathematicsAnalysis
1999English

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

Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2011English

Exponential Bounds for Intensity of Jumps

Mathematical Methods of Statistics
UncertaintyStatisticsProbability
2014English

Tight Lower Bounds for the Workflow Satisfiability Problem Based on the Strong Exponential Time Hypothesis

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
2016English

Lower Bounds

2016English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy