Reduction from Triangle Detection to Disjunctive Reachability Queries 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.

    10 April 2023

    • curprev 10:0010:00, 10 April 2023‎ Admin talk contribs‎ 650 bytes +650‎ Created page with "FROM: Triangle Detection TO: Disjunctive Reachability Queries in MDPs == Description == == Implications == assume: Strong Triangle<br/>then: there is no combinatorial $O(n^{3-\epsilon})$ or $O((k \cdot n^{2})^{1-\epsilon})$ algorithm for any $\epsilon > {0}$ for target. The bounds holf for dense MDPs with $m=\Theta(n^{2})$ == Year == 2016 == Reference == Chatterjee, Krishnendu, et al. "Model and objective separation with conditional lower bounds: Dis..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Reduction_from_Triangle_Detection_to_Disjunctive_Reachability_Queries_in_MDPs"