research
∙
05/09/2023
Scheme-Theoretic Approach to Computational Complexity. IV. A New Perspective on Hardness of Approximation
We provide a new approach for establishing hardness of approximation res...
research
∙
05/09/2023
Scheme-Theoretic Approach to Computational Complexity. III. SETH
We show that there exist infinitely many n ∈ℤ^+ such that for any consta...
research
∙
05/09/2023
4/3-Approximation of Graphic TSP
We describe a 4/3-approximation algorithm for the traveling salesman pro...
research
∙
05/09/2023
An Improved Approximation Algorithm for the Minimum 2-Vertex-Connected Spanning Subgraph Problem
We provide an algorithm for the minimum 2-vertex-connected spanning subg...
research
∙
07/06/2021
Scheme-theoretic Approach to Computational Complexity II. The Separation of P and NP over ℂ, ℝ, and ℤ
We show that the problem of determining the feasibility of quadratic sys...
research
∙
07/06/2021
Scheme-theoretic Approach to Computational Complexity I. The Separation of P and NP
We lay the foundations of a new theory for algorithms and computational ...
research
∙
11/17/2019
Approximation of Steiner Forest via the Bidirected Cut Relaxation
The classical algorithm of Agrawal, Klein and Ravi [SIAM J. Comput., 24 ...
research
∙
11/17/2019