Complexity bound for the absolute factorization of parametric polynomials A. Ayad OriginalPaper Pages: 2325 - 2339
On some properties of min-wise independent families and groups of permutations V. Bargachev OriginalPaper Pages: 2340 - 2345
Computing the dimension of a semi-algebraic set S. BasuR. PollackM.-F. Roy OriginalPaper Pages: 2346 - 2353
On the vertex connectivity of a relation in an association scheme S. A. EvdokimovI. N. Ponomarenko OriginalPaper Pages: 2354 - 2357
Towards applying computational complexity to foundations of physics V. KreinovichA. M. Finkelstein OriginalPaper Pages: 2358 - 2382
Automated proofs of upper bounds on the running time of splitting algorithms S. S. FedinA. S. Kulikov OriginalPaper Pages: 2383 - 2391
Intuitionistic Frege systems are polynomially equivalent G. MintsA. Kojevnikov OriginalPaper Pages: 2392 - 2402
On theoretical and practical acceleration of randomized computation of the determinant of an integer matrix V. Y. Pan OriginalPaper Pages: 2411 - 2424
On infinite real trace rational languages of maximum topological complexity O. FinkelJ.-P. RessayreP. Simonnet OriginalPaper Pages: 2435 - 2444