scientific article; zbMATH DE number 7561572
From MaRDI portal
Publication:5091238
DOI10.4230/LIPIcs.ICALP.2019.79MaRDI QIDQ5091238
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximate inclusion-exclusion for arbitrary symmetric functions
- An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem
- Sum-of-squares hierarchy lower bounds for symmetric formulations
- High degree sum of squares proofs, Bienstock-Zuckerberg hierarchy and CG cuts
- On the Matrix-Cut Rank of Polyhedra
- Convex Relaxations and Integrality Gaps
- Sum-of-squares Lower Bounds for Planted Clique
- Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method
- Lower Bounds on the Size of Semidefinite Programming Relaxations
- On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy
- Improved Approximation Guarantees through Higher Levels of SDP Hierarchies
- Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy
- Class of global minimum bounds of polynomial functions
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems.
- Subset Algebra Lift Operators for 0-1 Integer Programming
- Sum of squares lower bounds for refuting any CSP
- Analysis of Boolean Functions
- MaxMin allocation via degree lower-bounded arborescences
- Robust moment estimation and improved clustering via sum of squares
- The Power of Sherali--Adams Relaxations for General-Valued CSPs
- Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors
- On the sum-of-squares degree of symmetric quadratic functions
- Computation of the Lasserre Ranks of Some Polytopes
- Rounding Semidefinite Programming Hierarchies via Global Correlation
- Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives
- When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope
- Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems
- How to Sell Hyperedges: The Hypermatching Assignment Problem
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- Expander flows, geometric embeddings and graph partitioning
- Complexity of Positivstellensatz proofs for the knapsack
- Complexity of Null- and Positivstellensatz proofs
This page was built for publication:
