Reduction from BMM to Independent Set Queries
Revision as of 10:55, 15 February 2023 by Admin (talk | contribs) (Created page with "FROM: BMM TO: Independent Set Queries == Description == == Implications == if: to-time: $O(n^{2} / \log^c n)$ to answer all subsequent batches of $\log n$ independent set queries from a graph that takes $O(n^k)$ time to preprocess for some $c,k > {0}$<br/>then: from-time: $O(n^{3} / \log^{c+1} n)$ == Year == 2018 == Reference == V. V. Williams, R. R. Williams, Subcubic Equivalences Between Path, Matrix, and Triangle Problems. 2018. https://dl.acm.or...")
FROM: BMM TO: Independent Set Queries
Description
Implications
if: to-time: $O(n^{2} / \log^c n)$ to answer all subsequent batches of $\log n$ independent set queries from a graph that takes $O(n^k)$ time to preprocess for some $c,k > {0}$
then: from-time: $O(n^{3} / \log^{c+1} n)$
Year
2018
Reference
V. V. Williams, R. R. Williams, Subcubic Equivalences Between Path, Matrix, and Triangle Problems. 2018.
https://dl.acm.org/doi/pdf/10.1145/3186893, Theorem 6.5