海量图书期刊资源,随时随地畅享阅读乐趣
A decomposition of Boolean functionsCHASHKIN, A. V. · Discrete Mathematics and Applications · 2000
On domains completely specifying Boolean functionsCHASHKIN, A. V. · Discrete Mathematics and Applications · 1997
On linear operators injective on arbitrary subsetsChashkin, A. V. · Lobachevskii Journal of Mathematics · 2015
Realization of graphs in a subspace of bounded heightA. V. Chashkin · 2007
Average-case complexity of elementary Boolean functionsCHASHKIN, A. V. · Discrete Mathematics and Applications · 2001
On the complexity of restrictions of Boolean functionsCHASHKIN, A. V. · Discrete Mathematics and Applications · 1996
On the complexity of narrow systems of Boolean vectorsCHASHKIN, A. V. · Discrete Mathematics and Applications · 1999
Simulation of circuits of functional elements by the universal Turing machineChashkin, A. V. · Discrete Mathematics and Applications · 2004
MONOPHONIC DISTANCE IN GRAPHSSANTHAKUMARAN, A. P.; TITUS, P. · Discrete Mathematics, Algorithms and Applications · 2011
EXTREME STEINER GRAPHSSANTHAKUMARAN, A. P. · Discrete Mathematics, Algorithms and Applications · 2012
On a number triangleShestov, P. E. · Discrete Mathematics and Applications · 2006
A random algorithm for multiselectionAlsuwaiyel, M. H. · Discrete Mathematics and Applications · 2006
Periodically externally hereditary permutational automataBabash, A. V. · Discrete Mathematics and Applications · 2005
<I>p</I>-MatroidsKutyin, A. M. · Discrete Mathematics and Applications · 2005
Partitioning a <I>k</I>-connected graphLifshits, Yu. M. · Discrete Mathematics and Applications · 2005
On isomorphisms of quasigroupsShchukin, K. K. · Discrete Mathematics and Applications · 2005