Zapiski Nauchnykh Seminarov LOMI
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Zap. Nauchn. Sem. POMI:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

1984, Volume 137  
| General information | Contents |


Computational complexity theory. Part II


An Algorithm for some Sum of Reciprocals
V. I. Vichirko 		3–6
Bounds of real roots of a system of algebraic equations
N. N. Vorobjov (Jr.) 		7–19
Factoring polynomials over a finite field and solving systems of algebraic equations
D. Yu. Grigor'ev 		20–79
Linear-time recognition of tree-pictures isomorphism
A. N. Grigor'eva 		80–86
Upper bounds for lengthening of proofs after cut-elimination
V. P. Orevkov 		87–98
Polynomial isomorphism algorithm for graphs which are not contracted to $K_{3,g}$.
I. N. Ponomarenko 		99–114
Complexity and asymptotically optimal algorithms for generating absolutely continuous distributions
B. B. Pokhodzei 		115–123
Polynomial-time factoring of polynomials and finding the compounds of a variety within the aubexponential time
A. L. Chistov 		124–188
Записки научных семинаров ПОМИ
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025