Reduction from k-Clique to CFG Recognition

FROM: k-Clique TO: CFG Recognition

Implications

assume: k-Clique Hypothesis
then: there is no $O(N^{\{3}-\epsilon}) time combinatorial 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.

https://ieeexplore.ieee.org/abstract/document/8104058