Diskretnyi Analiz i Issledovanie Operatsii
RUS
ENG
JOURNALS
PEOPLE
ORGANISATIONS
CONFERENCES
SEMINARS
VIDEO LIBRARY
PACKAGE AMSBIB
JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Search papers
Search references
RSS
Latest issue
Current issues
Archive issues
What is RSS
Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find
Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register
2023, Volume 30, Issue 3
Estimates of implementation complexity for quantum cryptanalysis of post-quantum lattice-based cryptosystems
A. O. Bakharev
5–42
Additional constraints for dynamic competitive facility location problem
V. L. Beresnev, A. A. Melnikov
43–56
On a lower bound for the number of bent functions at the minimum distance from a bent function in the Maiorana–McfFrland class
D. A. Bykov, N. A. Kolomeec
57–80
Hypergraph edge representations with the use of homological paths
M. N. Vyalyi, V. E. Karpov
81–95
Ptas for problems of vector choice and clustering with different centers
A. V. Pyatkin
96–110
On trees with given diameter and extremal number of distance-
$k$
independent sets
D. S. Taletskii
111–131
Contact us:
email
Terms of Use
Registration to the website
Logotypes
©
Steklov Mathematical Institute RAS
, 2025