A lower bound on the complexity of realization of a Boolean function by two-layer contact circuits on the planar integer lattice
- 期刊名称Discrete Mathematics and Applications
- 作者ZADOROZHNYUK, O. A.
- 卷第7卷
- 期第3期
- 印刷ISSN0924-9265
- 电子ISSN1569-3929
- 文件大小1345.60KB
- 发表时间1997
- DOI10.1515/dma.1997.7.3.243
Extinction of decomposable branching processesVatutin, Vladimir A.; Dyakonova, Elena E. · Discrete Mathematics and Applications · 2016
Branching processes in a Markov random environmentDyakonova, Elena E. · Discrete Mathematics and Applications · 2014
Reduced multitype critical branching processes in random environmentDyakonova, Elena E. · Discrete Mathematics and Applications · 2018
Decomposable branching processes with two types of particlesVatutin, Vladimir A.; Dyakonova, Elena E. · Discrete Mathematics and Applications · 2018
A subcritical decomposable branching process in a mixed environmentDyakonova, Elena E. · Discrete Mathematics and Applications · 2018
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