Correlation polytopes: Their geometry and complexity
From MaRDI portal
Publication:1176573
DOI10.1007/BF01594946zbMath0741.90054OpenAlexW2064263748MaRDI QIDQ1176573
Publication date: 25 June 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01594946
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
Related Items (50)
A Polytope for a Product of Real Linear Functions in 0/1 Variables ⋮ The Boolean Quadric Polytope ⋮ Extremal Probability Bounds in Combinatorial Optimization ⋮ Application of cut polyhedra. I ⋮ Applications of cut polyhedra. II ⋮ \(t\)-copula from the viewpoint of tail dependence matrices ⋮ New classes of facets of the cut polytope and tightness of \(I_{mm22}\) Bell inequalities ⋮ The volume of relaxed Boolean-quadric and cut polytopes ⋮ Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations ⋮ Small violations of Bell inequalities for multipartite pure random states ⋮ A note on the geometric interpretation of Bell's inequalities ⋮ Necessary conditions for extended noncontextuality in general sets of random variables ⋮ On the inequivalence of the CH and CHSH inequalities due to finite statistics ⋮ The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints ⋮ On tail dependence matrices. The realization problem for parametric families ⋮ Tail-dependence, exceedance sets, and metric embeddings ⋮ Polynomial Bell Inequalities ⋮ Tight Probability Bounds with Pairwise Independence ⋮ Generalized cut polytopes for binary hierarchical models ⋮ From quantum discord and quantum entanglement to local hidden variable models ⋮ Compatibility of subsystem states ⋮ Classical Logic, Classical Probability, and Quantum Mechanics ⋮ The Argument Against Quantum Computers ⋮ Roots and (Re)sources of Value (In)definiteness Versus Contextuality ⋮ Hardy's non-locality paradox and possibilistic conditions for non-locality ⋮ Bell scenarios with communication ⋮ Quantum correlations and the measurement problem ⋮ New Bell inequalities for the singlet state: Going beyond the Grothendieck bound ⋮ Computational tools for solving a marginal problem with applications in Bell non-locality and causal modeling ⋮ Exploiting partial correlations in distributionally robust optimization ⋮ Leggett-Garg inequalities and the geometry of the cut polytope ⋮ Extending Bell inequalities to more parties ⋮ Generating facets for the cut polytope of a graph by triangular elimination ⋮ Quantum violation of the suppes-zanotti inequalities and ``contextuality ⋮ Analysing causal structures with entropy ⋮ The norms of Bloch vectors and a trade-off relation of svetlichny inequalities ⋮ Bell inequalities and the separability criterion ⋮ Membership testing for Bernoulli and tail-dependence matrices ⋮ Unbounded violation of tripartite Bell inequalities ⋮ Extension complexity of the correlation polytope ⋮ A maximum entropy approach to the realizability of spin correlation matrices ⋮ Volume computation for sparse Boolean quadric relaxations ⋮ COMPATIBILITY AND ATTAINABILITY OF MATRICES OF CORRELATION-BASED MEASURES OF CONCORDANCE ⋮ Macroscopic objects in quantum mechanics: A combinatorial approach ⋮ Symmetric Extensions of Quantum States and Local Hidden Variable Theories ⋮ Worst-Case Expected Shortfall with Univariate and Bivariate Marginals ⋮ Bipartite Bell inequalities with three ternary-outcome measurements—from theory to experiments ⋮ Lifting Bell inequalities ⋮ QMA-Hardness of Consistency of Local Density Matrices with Applications to Quantum Zero-Knowledge ⋮ Avenues to generalising Bell inequalities
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the probability of a Boolean polynomial of events
- Bivalent trees and forests or upper bounds for the probability of a union revisited
- The complexity of facets (and some facets of complexity)
- Boole's logic and probability. A critical exposition from the standpoint of contemporary algebra, logic and probability theory. 2nd ed., rev. and enlarged
- Quantum probability - quantum logic
- Best Linear Bonferroni Bounds
- An upper bound for the probability of a union
- Best Possible Inequalities for the Probability of a Logical Function of Events
- Neural networks and physical systems with emergent collective computational abilities.
- Proposed Experiment to Test Local Hidden-Variable Theories
- The complexity of satisfiability problems
- On the Probability of the Occurrence of at Least $m$ Events Among $n$ Arbitrary Events
This page was built for publication: Correlation polytopes: Their geometry and complexity
