A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Tighter Connections Between Formula-SAT and Shaving Logs
2018
International Colloquium on Automata, Languages and Programming
A noticeable fraction of Algorithms papers in the last few decades improve the running time of well-known algorithms for fundamental problems by logarithmic factors. For example, the O(n 2 ) dynamic programming solution to the Longest Common Subsequence problem (LCS) was improved to O(n 2 / log 2 n) in several ways and using a variety of ingenious tricks. This line of research, also known as the art of shaving log factors, lacks a tool for proving negative results. Specifically, how can we show
doi:10.4230/lipics.icalp.2018.8
dblp:conf/icalp/AbboudB18
fatcat:osoa7ftd5zes5pnmp6p54trkvi