Computing the optimal probability interval for the union of events is NP-hard.
Geometry of cuts and metrics , volume 15 of Algorithms and Combinatorics
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
Adjacency Sampling reproduces all known Bell inequality classes in solved cases and generates over 129 million classes for the L_{3,3,3,3} scenario plus millions more for larger ones.
Defines p-Wasserstein distances and divergences via quantum channels and proves triangle inequality for quadratic divergences assuming one state is pure.
citing papers explorer
-
Optimal Union Probability Interval Is NP-Hard
Computing the optimal probability interval for the union of events is NP-hard.
-
Bell Inequalities from Polyhedral Sampling
Adjacency Sampling reproduces all known Bell inequality classes in solved cases and generates over 129 million classes for the L_{3,3,3,3} scenario plus millions more for larger ones.
-
Wasserstein distances and divergences of order $p$ by quantum channels
Defines p-Wasserstein distances and divergences via quantum channels and proves triangle inequality for quadratic divergences assuming one state is pure.