Geodesic

Computational complexity theory. Part 5

Sommaire

Finding connected components of a semialgebraic set in subexponential time
p. 3-46
Complexity of solving linears systems in the rings of differential operators
p. 47-60
Complexity of irreducibility testing for a system of linear ordinary differential equations
p. 60-68
Computational complexity of winning strategies in two player polynomial games
p. 69-73
Polynomial-time recognizing and isomorphism testing for cyclic tournaments
p. 74-111
Polynomial-time factoring polynomials over local fields
p. 112-148
Computation of exponential integrals
p. 149-162
Construction of a shortest path around semi-algebraic obstacles in the plane
p. 163-173