RUS  ENG
Full version
JOURNALS // Zapiski Nauchnykh Seminarov POMI // Archive

1988, Volume 174

| General information | Contents |


Computational complexity theory. Part 3


Solving systems of polynomial inequalities over real closed fields in subexponential time
N. N. Vorobjov (Jr.), D. Yu. Grigor'ev
3
The parallel evaluation of arithmetic expressions involving one-variable functions
A. A. Gaganov
37
Complexity of deciding the first-order theory of real closed fields
D. Yu. Grigor'ev
53
Testing planar pictures isomorphism within linear time
A. N. Grigor'eva
101
Diophantine complexity
Yu. V. Matijasevich
122
Schemes of proof in Hilbert-type axiomatic theories
V. P. Orevkov
132
Isomorphism problem for classes of graphs closed under contractions
I. N. Ponomarenko
147


© Steklov Math. Inst. of RAS, 2025