Correlation polytopes: Their geometry and complexity
From MaRDI portal
Publication:1176573
DOI10.1007/BF01594946zbMath0741.90054MaRDI QIDQ1176573
Publication date: 25 June 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
52B12: Special polytopes (linear programming, centrally symmetric, etc.)
90C60: Abstract computational complexity for mathematical programming problems
90C27: Combinatorial optimization
Related Items
Bell inequalities and the separability criterion, The volume of relaxed Boolean-quadric and cut polytopes, Application of cut polyhedra. I, Applications of cut polyhedra. II, New classes of facets of the cut polytope and tightness of \(I_{mm22}\) Bell inequalities, Compatibility of subsystem states, Generating facets for the cut polytope of a graph by triangular elimination, Unbounded violation of tripartite Bell inequalities, Macroscopic objects in quantum mechanics: A combinatorial approach, Lifting Bell inequalities, New Bell inequalities for the singlet state: Going beyond the Grothendieck bound
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
