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

1982, Volume 118

| General information | Contents |


Computational complexity theory. Part I


Complexity lower bounds for machine computing models
A. P. Beltiukov
4
Lower hounds in the algebraic computational complexity
D. Yu. Grigor'ev
25
Graph isomorphism problem.
V. N. Zeml'ahenko, N. M. Korneyenko, R. I. Tyshkevich
83
Upper bounds on complexity of solving systems of linear equations.
V. I. Solodovnikov
159
Complexity questions in number theory
M. A. Frumkin
188


© Steklov Math. Inst. of RAS, 2025