Some test length bounds for nonrepeating functions in the {&, ∨} basis-Reference-Cited by-同舟云学术

Some test length bounds for nonrepeating functions in the {&, ∨} basis

Published:2010-04 Issue:2 Volume:21 Page:196-205
ISSN:1046-283X
Container-title:Computational Mathematics and Modeling
language:en
Short-container-title:Comput Math Model

Author:

Bubnov S. E.,Voronenko A. A.,Chistikov D. V.

Publisher

Springer Science and Business Media LLC

Subject

Computational Mathematics

Link

http://link.springer.com/content/pdf/10.1007/s10598-010-9064-8.pdf

Reference9 articles.

1. A. A. Voronenko, “On diagnostic tests for nonrepeating functions,” Matem. Voprosy Kibern., Fizmatlit, Moscow, No. 11, 163–176 (2002).

2. L. V. Ryabets, “Complexity of diagnostic tests for nonrepeating Boolean functions,” Diskretnaya Matematika i Informatika, No. 18, Irkutsk Gos. Ped. Univ., Irkutsk (2007).

3. A. A. Voronenko and D. V. Chistikov, “Individual testing of nonrepeating functions,” Uchenye Zapiski Kazan. Univ., Ser. Phys.-Math. Sci., 151, No. 2, 36–44 (2009).

4. A. A. Voronenko, “On the length of the diagnostic test for nonrepeating functions in the basis {0, 1, &, ∨, ¬} ,” Diskr. Matem., 17, No. 2, 139–143 (2005).

5. S. E. Bubnov, “Shannon function of the length of diagnostic tests for nonrepeating functions in an elementary basis,” Papers of Young Scientists of the MGU Faculty of Mathematics and Cybernetics [in Russian], MGU, MAKS Press, Moscow, No. 6, 47–57 (2009).

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

1. Checking Tests for Read-Once Functions over Arbitrary Bases;Computer Science – Theory and Applications;2012

2. Testing read-once functions over the elementary basis;Moscow University Computational Mathematics and Cybernetics;2011-11-19

3. Testing Monotone Read-Once Functions;Lecture Notes in Computer Science;2011