Computing the optimal probability interval for the union of events is NP-hard.
Cohen and Hector J
4 Pith papers cite this work. Polarity classification is still indexing.
4
Pith papers citing it
citation-role summary
background 1
method 1
citation-polarity summary
years
2026 4verdicts
UNVERDICTED 4representative citing papers
EgoDyn-Bench reveals a perception bottleneck in vision-centric foundation models: ego-motion logic derives from language while visual input adds negligible signal, with explicit trajectories restoring consistency.
Cognitive Trajectory Modeling offers a new conceptual framework for representing co-creative interaction dynamics as temporally organized trajectories in attractor landscapes, generalizing concepts from the Enactive Model of Creativity and Creative Sense-Making.
The paper sketches responsible non-compliance for autonomous AI agents, anchored in task refusal justifications, override pathways, security risk tracking, and liability transfers.
citing papers explorer
-
Optimal Union Probability Interval Is NP-Hard
Computing the optimal probability interval for the union of events is NP-hard.