No label defined (Q5091238)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7561572

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7561572

Statements

scholarly article

0 references

0 references

publication date

21 July 2022

0 references

zbMATH Keywords

SoS certificate

0 references

SoS rank

0 references

hypercube optimization

0 references

semidefinite programming

0 references

MaRDI profile type

MaRDI publication profile

0 references

Expander flows, geometric embeddings and graph partitioning

0 references

Dictionary Learning and Tensor Decomposition via the Sum-of-Squares Method

0 references

Rounding Semidefinite Programming Hierarchies via Global Correlation

0 references

MaxMin allocation via degree lower-bounded arborescences

0 references

Subset Algebra Lift Operators for 0-1 Integer Programming

0 references

0 references

A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

0 references

Computation of the Lasserre Ranks of Some Polytopes

0 references

Improved Approximation Guarantees through Higher Levels of SDP Hierarchies

0 references

Convex Relaxations and Integrality Gaps

0 references

On the Matrix-Cut Rank of Polyhedra

0 references

0 references

How to Sell Hyperedges: The Hypermatching Assignment Problem

0 references

0 references

When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?

0 references

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

0 references

Complexity of Positivstellensatz proofs for the knapsack

0 references

0 references

Complexity of Null- and Positivstellensatz proofs

0 references

Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives

0 references

Fast spectral algorithms from sum-of-squares proofs: tensor decomposition and planted sparse vectors

0 references

Robust moment estimation and improved clustering via sum of squares

0 references

Sum of squares lower bounds for refuting any CSP

0 references

Sum-of-squares hierarchy lower bounds for symmetric formulations

0 references

Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems.

0 references

An unbounded sum-of-squares hierarchy integrality gap for a polynomially solvable problem

0 references

On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy

0 references

0 references

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

0 references

Lower Bound for the Number of Iterations in Semidefinite Hierarchies for the Cut Polytope

0 references

0 references

Lower Bounds on the Size of Semidefinite Programming Relaxations

0 references

On the sum-of-squares degree of symmetric quadratic functions

0 references

Robust Algorithms for on Minor-Free Graphs Based on the Sherali-Adams Hierarchy

0 references

High degree sum of squares proofs, Bienstock-Zuckerberg hierarchy and CG cuts

0 references

Sum-of-squares Lower Bounds for Planted Clique

0 references

Analysis of Boolean Functions

0 references

0 references

Exact Semidefinite Programming Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems

0 references

Approximate inclusion-exclusion for arbitrary symmetric functions

0 references

Class of global minimum bounds of polynomial functions

0 references

The Power of Sherali--Adams Relaxations for General-Valued CSPs

0 references

0 references

Identifiers

10.4230/LIPIcs.ICALP.2019.79

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5091238

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5091238&oldid=36832992"