Prikladnaya Diskretnaya Matematika
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


Prikl. Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

2011, Number 3(13)  

Theoretical Foundations of Applied Discrete Mathematics
Fast algorithm for statistical estimation of the maximal imbalance of bilinear approximations of Boolean mappings
A. N. Alekseychuk, A. S. Shevtsov 		5–11
On the complexity of proving that a Boolean function is not a binary read-once
A. A. Voronenko 		12–16
Method for constructing elliptic curves using complex multiplication and its optimizations
E. A. Grechnikov 		17–54

Mathematical Foundations of Computer Security
Implementation of security policies in programming information processing systems
D. A. Stefantsov 		55–64

Applied Graph Theory
Computational aspects of treewidth for graph
V. V. Bykova 		65–79
Computational complexity of the problem of approximation by graphs with connected components of bounded size
V. P. Il'ev, A. A. Navrocka 		80–84
Interval on one party regular edge 5-coloring of bipatite graph
A. M. Magomedov, T. A. Magomedov 		85–91
Structural and communicative properties of circulant networks
E. A. Monakhova 		92–115

Computational Methods in Discrete Mathematics
On implementation of the meet-in-the-middle attack by means of parallel computations
V. M. Fomichev 		116–121

Mathematical Foundations of Intelligent Systems
Analytical incomplete multiplicative pairwise comparisons method
I. S. Kiselev 		122–128
Прикладная дискретная математика
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025