Prikl. Diskr. Mat., 2011, Number 3(13)

JOURNALS // Prikladnaya Diskretnaya Matematika // Archive

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
	On the complexity of proving that a Boolean function is not a binary read-once A. A. Voronenko	12
	Method for constructing elliptic curves using complex multiplication and its optimizations E. A. Grechnikov	17

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

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

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

Mathematical Foundations of Intelligent Systems
	Analytical incomplete multiplicative pairwise comparisons method I. S. Kiselev	122