1. Finding connected components of a semialgebraic set in subexponential time

   • N. N. Vorob'ev Jr.
   • D. Yu. Grigor'ev

   OriginalPaper Pages: 1847 - 1872

2. Complexity of solution of linear systems in rings of differential operators

   • D. Yu. Grigor'ev

   OriginalPaper Pages: 1873 - 1880

3. Complexity of testing irreducibility of a system of linear ordinary differential equations

   • D. Yu. Grigor'ev

   OriginalPaper Pages: 1881 - 1886

4. Computational complexity of winning strategies in two-person polynomial games

   • J. P. Jones

   OriginalPaper Pages: 1887 - 1889

5. Polynomial time recognition and testing of isomorphism of cyclic tournaments

   • I. N. Ponomarenko

   OriginalPaper Pages: 1890 - 1911

6. Algorithm of polynomial complexity for factoring polynomials over local fields

   • A. L. Chistov

   OriginalPaper Pages: 1912 - 1933

7. Computation of exponential integrals

   • A. I. Barvinok

   OriginalPaper Pages: 1934 - 1943

8. Search for shortest path around semialgebraic obstacles in the plane

   • T. Krick
   • A. O. Slisenko
   • J. Heintz

   OriginalPaper Pages: 1944 - 1949