Reduction from k-Clique to CFG Recognition
Revision as of 12:19, 15 February 2023 by Admin (talk | contribs) (Created page with "FROM: k-Clique TO: CFG Recognition == Description == == Implications == assume: k-Clique Hypothesis<br/>then: there is no $O(N^{\omega-\epsilon}) time algorithm for target for any $\epsilon > {0}$ == Year == 2017 == Reference == Abboud, A., Backurs, A., Bringmann, K., & Künnemann, M. (2017, October). Fine-grained complexity of analyzing compressed data: Quantifying improvements over decompress-and-solve. In 2017 IEEE 58th Annual Symposium on Foundat...")
FROM: k-Clique TO: CFG Recognition
Description
Implications
assume: k-Clique Hypothesis
then: there is no $O(N^{\omega-\epsilon}) time algorithm for target for any $\epsilon > {0}$
Year
2017
Reference
Abboud, A., Backurs, A., Bringmann, K., & Künnemann, M. (2017, October). Fine-grained complexity of analyzing compressed data: Quantifying improvements over decompress-and-solve. In 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) (pp. 192-203). IEEE.