Reduction from OV to Disjunctive Queries of Safety in Graphs

FROM: OV TO: Disjunctive Queries of Safety in Graphs

Implications

assume: OVH
then: there is no $O(m^{2-\epsilon})$ or $O((k \cdot m)^{1 - \epsilon})$ algorithm for any $\epsilon > {0}$ for disjunctive safety ovjectives/queries in MDPs.

Year

2016

Reference

Chatterjee, Krishnendu, et al. "Model and objective separation with conditional lower bounds: Disjunction is harder than conjunction." Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science. 2016.

https://dl.acm.org/doi/pdf/10.1145/2933575.2935304