Reduction from CNF-SAT to Dynamic 4/3-Diameter
Jump to navigation
Jump to search
FROM: CNF-SAT TO: Dynamic 4/3-Diameter
Description
Implications
if: to-time: $O(m^{2-\epsilon})$ amrotized update and query times, for any $\epsilon > {0}$, even after arbitrarily long polynomial time preprocessing
then: SETH is false
Year
2014
Reference
Abboud, Amir, and Virginia Vassilevska Williams. "Popular conjectures imply strong lower bounds for dynamic problems." In 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, pp. 434-443. IEEE, 2014.