
Schemetheoretic 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...
read it

Schemetheoretic Approach to Computational Complexity I. The Separation of P and NP
We lay the foundations of a new theory for algorithms and computational ...
read it

Approximation of Steiner Forest via the Bidirected Cut Relaxation
The classical algorithm of Agrawal, Klein and Ravi [SIAM J. Comput., 24 ...
read it

5/4Approximation of Minimum 2EdgeConnected Spanning Subgraph
We provide a 5/4approximation algorithm for the 2edge connected spanni...
read it
Ali Çivril
is this you? claim profile