Geodesic

Computational complexity theory. Part IX

Sommaire

Complexity bound of absolute factoring of parametric polynomials
p. 5-29
On some properties of min-wise independent families and groups of permutations
p. 30-41
Computing the dimension of a~semi-algebraic set
p. 42-54
On the vertex connectivity of a~relation in association scheme
p. 55-62
Towards Applying Computational Complexity to Foundations of Physics
p. 63-110
Automated proofs of upper bounds on the running time of splitting algorithms
p. 111-128
Intuitionistic frege systems are polynomially equivalent
p. 129-146
A~new decidable Horn fragment of the predicate calculus
p. 147-162
On theoretical and practical acceleration of randomized computation of the determinant of an integer matrix
p. 163-187
Circuit lower bounds and linear codes
p. 188-204
On infinite real trace rational languages of maximum topological complexity
p. 205-223