Geodesic

Computational complexity theory. Part 4

Sommaire

Deciding consistency of systems of polynomial in exponent inequalities in subexponential time
p. 3-52
Complexity of quantifier elimination in the theory of ordinary differentially closed fields
p. 53-67
Complexity of factoring and GCD calculating for linear ordinary differential operators
p. 68-103
Factoring a solvable polynomial over a finite field and Generalized Riemann Hypothesis
p. 104-117
A note on a extension of Kreisel's conjecture
p. 118-126
Polynomial-time algorithms for computational problems in the theory of algebraic curves
p. 127-150