Scheme-Theoretic Approach to Computational Complexity. III. SETH

05/09/2023

∙

by   Ali Çivril, et al.

∙

0

∙

share

We show that there exist infinitely many n ∈ℤ^+ such that for any constant ϵ > 0, any deterministic algorithm to solve k- for k ≥ 3 must perform at least (2^k-3/2-ϵ)^n/k+1 operations, where n is the number of variables in the k instance.