Geodesic

Computational complexity theory. Part II

Sommaire

An Algorithm for some Sum of Reciprocals
p. 3-6
Bounds of real roots of a system of algebraic equations
p. 7-19
Factoring polynomials over a finite field and solving systems of algebraic equations
p. 20-79
Linear-time recognition of tree-pictures isomorphism
p. 80-86
Upper bounds for lengthening of proofs after cut-elimination
p. 87-98
Polynomial isomorphism algorithm for graphs which are not contracted to $K_{3,g}$.
p. 99-114
Complexity and asymptotically optimal algorithms for generating absolutely continuous distributions
p. 115-123
Polynomial-time factoring of polynomials and finding the compounds of a variety within the aubexponential time
p. 124-188