Computing the optimal probability interval for the union of events is NP-hard.
Fomin and Dieter Kratsch.Exact Exponential Algorithms
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
Improves exact algorithm for minimum edge deletion to connected cactus from O*(3^n) to O*(2^n), with O*(2^n n^{O(q)}) for q distinct nonnegative costs and O*(2^n (W+1)) pseudo-polynomial for integer costs summing to W.
citing papers explorer
-
Optimal Union Probability Interval Is NP-Hard
Computing the optimal probability interval for the union of events is NP-hard.
-
Exact Algorithms for Edge Deletion to Cactus Graphs and Weighted Variants
Improves exact algorithm for minimum edge deletion to connected cactus from O*(3^n) to O*(2^n), with O*(2^n n^{O(q)}) for q distinct nonnegative costs and O*(2^n (W+1)) pseudo-polynomial for integer costs summing to W.