Reduction from OV to Disjunctive Queries of Reachability in MDPs: Difference between revisions
Jump to navigation
Jump to search
(Created page with "FROM: OV TO: Disjunctive Queries of Reachability in MDPs == Description == == Implications == assume: Strong Triangle<br/>then: there is no $O(m^{2-\epsilon})$ or $O((k \cdot m)^{1-\epsilon})$ algorithm, for any $\epsilon > {0}$ for target. == 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 Sympos...") |
No edit summary |
||
| Line 1: | Line 1: | ||
FROM: [[OV]] TO: [[Disjunctive Queries | FROM: [[OV]] TO: [[Disjunctive Reachability Queries in MDPs]] | ||
== Description == | == Description == | ||
Latest revision as of 15:51, 15 February 2023
FROM: OV TO: Disjunctive Reachability Queries in MDPs
Description
Implications
assume: Strong Triangle
then: there is no $O(m^{2-\epsilon})$ or $O((k \cdot m)^{1-\epsilon})$ algorithm, for any $\epsilon > {0}$ for target.
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.