Outside Computation with Superior Functions

Download PDF
Open Webpage

Parker Riley, Daniel Gildea

Published: 01 Jan 2021, Last Modified: 15 Oct 2024NAACL-HLT 2021EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: We show that a general algorithm for efficient computation of outside values under the minimum of superior functions framework proposed by Knuth (1977) would yield a sub-exponential time algorithm for SAT, violating the Strong Exponential Time Hypothesis (SETH).