On Super Strong ETH

Author(s)
Vyas, Nikhil; Williams, Ryan
Thumbnail
Downloadrandom_k_sat_lncs__source_clean.pdf (404.7Kb)
Publisher Policy
Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
Abstract
Multiple known algorithmic paradigms (backtracking, local search and the polynomial method) only yield a 2[superscript n(1-1/O(k))] time algorithm for k-SAT in the worst case. For this reason, it has been hypothesized that the worst-case k-SAT problem cannot be solved in 2[superscript n(1-f(k)/k)] time for any unbounded function f. This hypothesis has been called the "Super-Strong ETH", modelled after the ETH and the Strong ETH.
Date issued
2021-01
URI
https://hdl.handle.net/1721.1/129796
Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Journal
Journal of Artificial Intelligence Research
Publisher
AI Access Foundation
Citation
Vyas, Nikhil and Ryan Williams. "On Super Strong ETH." Journal of Artificial Intelligence Research 70 (January 2021): 473-495 © 2021 AI Access Foundation
Version: Final published version
ISSN
1076-9757
Collections