Pages that link to "Item:Q5717829"
From MaRDI portal
The following pages link to Two-party Bell inequalities derived from combinatorics via triangular elimination (Q5717829):
Displaying 15 items.
- Lifting and separation procedures for the cut polytope (Q403653) (← links)
- On the extension complexity of combinatorial polytopes (Q745682) (← links)
- Generalized cut and metric polytopes of graphs and simplicial complexes (Q2174869) (← links)
- New classes of facets of the cut polytope and tightness of \(I_{mm22}\) Bell inequalities (Q2381532) (← links)
- Generating facets for the cut polytope of a graph by triangular elimination (Q2465651) (← links)
- Varieties of contextuality based on probability and structural nonembeddability (Q2672646) (← links)
- Enumeration of the facets of cut polytopes over some highly symmetric graphs (Q2827757) (← links)
- Looking for symmetric Bell inequalities (Q3161105) (← links)
- Leggett-Garg inequalities and the geometry of the cut polytope (Q4903062) (← links)
- Extending Bell inequalities to more parties (Q4903127) (← links)
- Causal structures from entropic information: geometry and novel scenarios (Q5143193) (← links)
- On the inequivalence of the CH and CHSH inequalities due to finite statistics (Q5347999) (← links)
- Quasi-Bell inequalities from symmetrized products of noncommuting qubit observables (Q5738696) (← links)
- Bipartite Bell inequalities with three ternary-outcome measurements—from theory to experiments (Q5854997) (← links)
- The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints (Q6060149) (← links)