Prikl. Diskr. Mat., 2014, Number 2(24)

Prikladnaya Diskretnaya Matematika

RUS ENG

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

2014, Number 2(24)

Theoretical Foundations of Applied Discrete Mathematics
	Combinatorial properties of rectangular $0,1$-matrix systems Y. E. Avezova, V. M. Fomichev	5–11
	On one continual set of $\beta$-closed classes of the multivalued logic functions D. K. Podolko	12–20
	Recovery of a polynomially complicated linear recurring sequence over Galois ring by its senior coordinate E. M. Serebryakov	21–36
	Computation of nonlinearity degree for discrete functions on primary cyclic groups A. V. Cheremushkin	37–47

Mathematical Foundations of Computer Security
	Analysis of the conditions for granting and obtaining access rights in the MS SQL Server access control model V. Y. Slolyaninov	48–78

Applied Graph Theory
	Analytic complexity of cluster trees A. I. Normov, T. M. Sadykov	79–87
	Estimates for exponent of some graphs by Frobenius's numbers of three arguments V. M. Fomichev	88–96
	Proof of asymptotic constants in disconnection probability for weighted planar graph G. Sh. Tsitsiashvili, M. A. Osipova, A. S. Losev	97–100

Logical Design of Discrete Automata
	Fast synthesis of invertible circuits based on permutation group theory D. V. Zakablukov	101–109
	Protecting intellectual property in FPGA Xilinx design D. I. Cheremisinov	110–118

Computational Methods in Discrete Mathematics
	Simultaneous search for several binary patterns in a stream with finite-state automaton I. V. Pankratov	119–125