Grothendieck-Type Inequalities in Combinatorial Optimization (Q2892967): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Grothendieck constant of random and pseudo-random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Randomness and Algorithmic Regularity for Graphs with General Degree Distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Algorithmic Aspects of the Regularity Lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random sampling and approximation of MAX-CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic forms on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Cut-Norm via Grothendieck's Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Repeated communication and Ramsey graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3181596 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularity Lemmas and Combinatorial Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2734156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Grothendieck Inequality Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional extensions of the Grothendieck inequality and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Grothendieck Constant is Strictly Smaller than Krivine's Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalized Grothendieck inequality and nonlocal correlations that require high entanglement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grothendieck inequalities for semidefinite programs with rank constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Positive Semidefinite Grothendieck Problem with Rank Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering with qualitative information / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Sparse Regularity Concept / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for graph regularity and removal lemmas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3752116 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bell Inequalities, Grothendieck’s Constant, and Root Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quick approximation to matrices and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3594446 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization for sparse \(\varepsilon\)-regular pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds of tower type for Szemerédi's uniformity lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bypassing UGC from Some Optimal Geometric Inapproximability Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Grothendieck inequality for bilinear forms on \(C^*\)-algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new upper bound for the complex Grothendieck constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the advantage over a random assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum correlation and Grothendieck's constant / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2760167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymptotic behaviour of Lovasz' \(\vartheta\) function for random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate graph coloring by semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5464925 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Entangled Games Are Hard to Approximate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Equations Modulo 2 and the $L_1$ Diameter of Convex Bodies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Kernel Clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3191598 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The UGC Hardness Threshold of the <i>L<sub>p</sub></i> Grothendieck Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Szemerédi’s Regularity Lemma for Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for Checking Regularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constantes de Grothendieck et fonctions de type positif sur les sphères / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Grothendieck constant of some graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds in Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity measures of sign matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Complexity vs Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds in communication complexity based on factorization norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Szemerédi's lemma for the analyst / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximization of quadratic form over intersection of ellipsoids with common center / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxation and nonconvex quadratic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded violation of tripartite Bell inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grothendieck's theorem for noncommutative \(C^*\)-algebras, with an appendix on Grothendieck's constants / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grothendieck’s Theorem, past and present / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Bell inequalities for the singlet state: Going beyond the Grothendieck bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulating Quantum Correlations with Finite Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of the Grothendieck inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completely Bounded Multilinear Maps and Grothendieck's Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Von Neumann Inequality for Polynomials in Several Hilbert-Schmidt Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3810388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an inequality of von Neumann and an application of the metric theory of tensor products to operators theory. (Appendix by S. Kaijser and N. Th. Varopoulos.) / rank
 
Normal rank

Latest revision as of 09:05, 5 July 2024

scientific article
Language Label Description Also known as
English
Grothendieck-Type Inequalities in Combinatorial Optimization
scientific article

    Statements

    Grothendieck-Type Inequalities in Combinatorial Optimization (English)
    0 references
    0 references
    0 references
    25 June 2012
    0 references
    Grothendieck inequality
    0 references
    combinatorial optimisation
    0 references
    computational complexity
    0 references
    integer programming
    0 references
    cut norm
    0 references
    Szemerédi partitions
    0 references
    Frieze-Kannan matrix decompositions
    0 references
    maximum acyclic subgraphs
    0 references
    linear equations modulo~\(2\)
    0 references
    Grothendieck constant
    0 references
    graph
    0 references
    kernel clustering
    0 references
    propeller conjecture
    0 references
    unique games conjecture
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references