Reduction from k-Clique to CFG Recognition: 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.

28 April 2023

10 April 2023

15 February 2023

  • curprev 11:1911:19, 15 February 2023‎ Admin talk contribs‎ 582 bytes +582‎ 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..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Reduction_from_k-Clique_to_CFG_Recognition"