Reduction from OV to Disjunctive Queries of Reachability in MDPs: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

15 February 2023

  • curprev 12:1912:19, 15 February 2023‎ Admin talk contribs‎ 566 bytes +566‎ 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..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Reduction_from_OV_to_Disjunctive_Queries_of_Reachability_in_MDPs"