Deciding consistency of systems of exponential-polynomial inequalities in subexponential time N. N. Vorob'ev Jr. OriginalPaper Pages: 789 - 814
Complexity of quantifier elimination in the theory of ordinary differentially closed fields D. Yu. Grigor'ev OriginalPaper Pages: 814 - 822
Complexity of factorization and GCD computation for linear ordinary differential operators D. Yu. Grigor'ev OriginalPaper Pages: 823 - 841
Factorization of solvable polynomials over finite fields and the generalized Riemann hypothesis S. A. Evdokimov OriginalPaper Pages: 842 - 849
Polynomial complexity algorithms for computational problems in the theory of algebraic curves A. L. Chistov OriginalPaper Pages: 855 - 867
