Approximating CSPs Using LP Relaxation (Q3448840)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Approximating CSPs Using LP Relaxation	scientific article

Statements

scholarly article

0 references

Approximating CSPs Using LP Relaxation (English)

0 references

Subhash A. Khot

0 references

0 references

Automata, Languages, and Programming

0 references

publication date

27 October 2015

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-662-47672-7_67

0 references

Approximation resistance from pairwise independent subgroups

0 references

Near-optimal algorithms for unique games

0 references

Towards a Characterization of Constant-Factor Approximable Min CSPs

0 references

On the optimality of the random hyperplane rounding technique for MAX CUT

0 references

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

0 references

On the power of unique 2-prover 1-round games

0 references

Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?

0 references

Approximating CSPs Using LP Relaxation

0 references

Approximation of non-boolean 2CSP

0 references

0 references

Linear programming, width-1 CSPs, and robust satisfaction

0 references

0 references

Gaussian bounds for noise correlation of functions

0 references

Noise stability of functions with low influences: invariance and optimality

0 references

0 references

Parallel approximation algorithms by positive linear programming

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-662-47672-7_67

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3448840

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