Reduction from Max-Weight K-Clique to Maximum Square Subarray
Revision as of 12:19, 15 February 2023 by Admin (talk | contribs) (Created page with "FROM: Max-Weight K-Clique TO: Maximum Square Subarray == Description == == Implications == if: to-time: $O(n^{d+{1}-\epsilon})$ for $d$-dimensional hypercube arrays<br/>then: from-time: $O(n^{k-\epsilon})$ on $n$ vertex graphs for $k=d+{1}$ == Year == 2016 == Reference == Backurs, Arturs, Nishanth Dikkala, and Christos Tzamos. "Tight Hardness Results for Maximum Weight Rectangles}}." 43rd International Colloquium on Automata, Languages, and Programm...")
FROM: Max-Weight K-Clique TO: Maximum Square Subarray
Description
Implications
if: to-time: $O(n^{d+{1}-\epsilon})$ for $d$-dimensional hypercube arrays
then: from-time: $O(n^{k-\epsilon})$ on $n$ vertex graphs for $k=d+{1}$
Year
2016
Reference
Backurs, Arturs, Nishanth Dikkala, and Christos Tzamos. "Tight Hardness Results for Maximum Weight Rectangles}}." 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Vol. 55. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2016.