A. Çivril

activity

20102024

most citedScheme-theoretic Approach to Computational Complexity I. The Separation of P and NP

2 citations · 6 across the 15 of their papers we have counts for

collaborators

Showing 2023 · cs.CCShow all

2 papers · 2 filters

cs.CC2023

Scheme-Theoretic Approach to Computational Complexity. IV. A New Perspective on Hardness of Approximation

Ali Çivril

We provide a new approach for establishing hardness of approximation results, based on the theory recently introduced by the author. It allows one to directly show that approximati…

cs.CC2023

Scheme-Theoretic Approach to Computational Complexity. III. SETH

Ali Çivril

We show that there exist infinitely many $n \in Z^{+}$ such that for any constant $ε > 0$ , any deterministic algorithm to solve $k$ -\textsf{SAT} for $k \geq 3$ must perform a…