RUS
ENG
Full version
JOURNALS
// Zapiski Nauchnykh Seminarov POMI
// Archive
1989, Volume 176
|
General information
|
Contents
|
Computational complexity theory. Part 4
Deciding consistency of systems of polynomial in exponent inequalities in subexponential time
N. N. Vorobjov (Jr.)
3
Complexity of quantifier elimination in the theory of ordinary differentially closed fields
D. Yu. Grigor'ev
53
Complexity of factoring and GCD calculating for linear ordinary differential operators
D. Yu. Grigor'ev
68
Factoring a solvable polynomial over a finite field and Generalized Riemann Hypothesis
S. A. Evdokimov
104
A note on a extension of Kreisel's conjecture
V. P. Orevkov
118
Polynomial-time algorithms for computational problems in the theory of algebraic curves
A. L. Chistov
127
©
Steklov Math. Inst. of RAS
, 2025
