Exponential Lower Bounds for Polytopes in Combinatorial Optimization (Q2796404): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1755753347 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1111.0837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Local Search by Quantum Arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lattice problems in NP ∩ coNP / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the extension complexity of combinatorial polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending SDP Integrality Gaps to Sherali-Adams with Applications to Quadratic Programming and MaxCutGain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Limits of Linear Programs (Beyond Hierarchies) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average case polyhedral complexity of the maximum stable set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Information-theoretic approximations of the nonnegative rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Common information and unique disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: An information complexity approach to extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Existence of 0/1 Polytopes with High Semidefinite Extension Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002766 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Constraint Satisfaction Requires Large LP Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrality gaps for Sherali-Adams relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cut polytope and the Boolean quadric polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry of cuts and metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations, nonnegative factorizations, and randomized communication protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial bounds on nonnegative rank and extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized probabilistic theories and conic extensions of polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrality Gaps of $2-o(1)$ for Vertex Cover SDPs in the Lovász–Schrijver Hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sherali-Adams Gaps from Pairwise Independence / 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: Theta Bodies for Polynomial Ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifts of Convex Sets and Cone Factorizations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample to the Alon-Saks-Seymour conjecture and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Protocols for Generating Bipartite Classical Distributions and Quantum States / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry Matters for the Sizes of Extended Formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof that the extension complexity of the correlation polytope grows exponentially / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential lower bound for 2-query locally decodable codes via a quantum argument / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050157 / 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: Communication Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Communication Complexity of Set-Disjointness with Small Sets and 0-1 Intersection / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of communication complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on the Size of Semidefinite Programming Relaxations / 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: Q4407449 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Communication complexity and combinatorial lattice theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the extension complexity of the knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distributional complexity of disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Matching Polytope has Exponential Extension Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392273 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulation and Decomposition of Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quantum communication and complexity. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterministic Quantum Query and Communication Complexities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing combinatorial optimization problems by linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Polytopes / rank
 
Normal rank

Latest revision as of 15:52, 11 July 2024

scientific article
Language Label Description Also known as
English
Exponential Lower Bounds for Polytopes in Combinatorial Optimization
scientific article

    Statements

    Exponential Lower Bounds for Polytopes in Combinatorial Optimization (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 March 2016
    0 references
    combinatorial optimization
    0 references
    communication complexity
    0 references
    linear programming
    0 references
    quantum communication complexity
    0 references
    semidefinite programming
    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