On the Complexity of Multivalued Logic Functions over Some Infinite Basis-Reference-Cited by-同舟云学术

On the Complexity of Multivalued Logic Functions over Some Infinite Basis

Published:2018-01 Issue:1 Volume:12 Page:40-58
ISSN:1990-4789
Container-title:Journal of Applied and Industrial Mathematics
language:en
Short-container-title:J. Appl. Ind. Math.

Author:

Kochergin V. V.,Mikhailovich A. V.

Publisher

Pleiades Publishing Ltd

Subject

Applied Mathematics,Industrial and Manufacturing Engineering

Link

http://link.springer.com/article/10.1134/S1990478918010052/fulltext.html

Reference24 articles.

1. N. A. Karpova, “Some Properties of Shannon Functions,” Mat. Zametki 8 (5), 663–674 (1970) [Math. Notes 8 (5), 843–849 (1970)].

2. O.M. Kasim-Zade, “Complexity of Circuits in an Infinite Basis,” Vestnik Moskov. Univ. Ser. 1, No. 6, 40–44 (1994).

3. O. M. Kasim-Zade, “Orders of Growth of Shannon Functions for Circuit Complexity over Infinite Bases,” VestnikMoskov.Univ. Ser. 1,Mat. Mekh.No. 3, 55–57 (2013) [Moscow Univ.Math. Bull. 68 (3), 170–172 (2013)].

4. V. V. Kochergin, “Theory of Rectifier Circuits (the Current State),”in Discrete Mathematics and Its Applications, Vol. 7 (Inst. Prikl. Mat. Ross. Akad. Nauk, Moscow, 2013), pp. 23–40 [Available at http://www.keldysh.ru/dmschool/datastore/media/dmsc9_lect7.pdf (accessed Nov. 16, 2017)].

5. V. V. Kochergin and A. V. Mikhailovich, “On the Complexity of Circuits in Bases Containing Monotone Elements with Zero Weights,” Prikl. Diskretn.Mat. No. 4, 24–31 (2015).

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Improvement of Nonmonotone Complexity Estimates of $$k$$-Valued Logic Functions;Mathematical Notes;2023-06

2. Bounds of Non-Monotone Complexity for the Multi-Valued Logic Functions;Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki;2020