Fast algorithm for statistical estimation of the maximal imbalance of bilinear approximations of Boolean mappings // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2011. № 3(13). P. 5–11.
5–11
On the complexity of proving that a Boolean function is not abinary read-once // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2011. № 3(13). P. 12–16.
12–16
Method for constructing elliptic curves using complex multiplicationand its optimizations // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2011. № 3(13). P. 17–54.
17–54
Implementation of security policies in programming informationprocessing systems // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2011. № 3(13). P. 55–64.
55–64
Computational aspects of graph treewidth // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2011. № 3(13). P. 65–79.
65–79
Computational complexity of the problem of approximation by graphs with connected components of bounded size // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2011. № 3(13). P. 80–84.
80–84
Regular edge 5-coloring of bipatite graph that is an interval on one part // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2011. № 3(13). P. 85–91.
85–91
Structural and communicative properties of circulant networks // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2011. № 3(13). P. 92–115.
92–115
On implementation of the meet-in-the-middle attack by means ofparallel computations // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2011. № 3(13). P. 116–121.
116–121
Analytical method for making definite multiple preferences in thematrix of incomplete pairwise comparisons // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2011. № 3(13). P. 122–128.
122–128
Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2011. № 3(13).
Download full-text version
Download fileCounter downloads: 249