Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Nathan Segerlind
Exponential Lower Bounds and Integrality Gaps for Tree-Like Lovász-Schrijver Procedures
Related publications
Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Improved Lower Bounds for Tree-Like Resolution Over Linear Inequalities
Exponential Lower Bounds for the Pigeonhole Principle
On Lower Bounds of Exponential Frames
Journal of Fourier Analysis and Applications
Mathematics
Applied Mathematics
Analysis
A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
Mathematics of Operations Research
Management Science
Computer Science Applications
Operations Research
Mathematics
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds
Computational Complexity
Mathematics
Computational Mathematics
Theoretical Computer Science
Computational Theory
Exponential Bounds for Intensity of Jumps
Mathematical Methods of Statistics
Uncertainty
Statistics
Probability
Tight Lower Bounds for the Workflow Satisfiability Problem Based on the Strong Exponential Time Hypothesis
Information Processing Letters
Signal Processing
Computer Science Applications
Information Systems
Theoretical Computer Science
Lower Bounds
