Geodesic

Computational complexity theory. Part 3

Sommaire

Solving systems of polynomial inequalities over real closed fields in subexponential time
p. 3-36
The parallel evaluation of arithmetic expressions involving one-variable functions
p. 37-52
Complexity of deciding the first-order theory of real closed fields
p. 53-100
Testing planar pictures isomorphism within linear time
p. 101-121
Diophantine complexity
p. 122-131
Schemes of proof in Hilbert-type axiomatic theories
p. 132-146
Isomorphism problem for classes of graphs closed under contractions
p. 147-177