Computing the optimal probability interval for the union of events is NP-hard.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Proves a primitive inhomogeneous Diophantine approximation theorem in high dimensions for fixed non-singular frequencies belonging to an explicit full-measure class.
citing papers explorer
-
Optimal Union Probability Interval Is NP-Hard
Computing the optimal probability interval for the union of events is NP-hard.
-
Primitive inhomogeneous approximation for fixed non-singular frequencies
Proves a primitive inhomogeneous Diophantine approximation theorem in high dimensions for fixed non-singular frequencies belonging to an explicit full-measure class.