Geodesic

Volume (2011) no. 3

Sommaire

Fast algorithm for statistical estimation of the maximal imbalance of bilinear approximations of Boolean mappings
p. 5-11
On the complexity of proving that a~Boolean function is not a~binary read-once
p. 12-16
Method for constructing elliptic curves using complex multiplication and its optimizations
p. 17-54
Implementation of security policies in programming information processing systems
p. 55-64
Computational aspects of treewidth for graph
p. 65-79
Computational complexity of the problem of approximation by graphs with connected components of bounded size
p. 80-84
Interval on one party regular edge 5-coloring of bipatite graph
p. 85-91
Structural and communicative properties of circulant networks
p. 92-115
On implementation of the meet-in-the-middle attack by means of parallel computations
p. 116-121
Analytical incomplete multiplicative pairwise comparisons method
p. 122-128