Testing read-once functions over the elementary basis-Reference-Cited by-同舟云学术

Testing read-once functions over the elementary basis

Published:2011-11-19 Issue:4 Volume:35 Page:189-192
ISSN:0278-6419
Container-title:Moscow University Computational Mathematics and Cybernetics
language:en
Short-container-title:MoscowUniv.Comput.Math.Cybern.

Author:

Chistikov D. V.

Publisher

Allerton Press

Subject

Computational Mathematics,Control and Optimization,Human-Computer Interaction

Link

http://link.springer.com/content/pdf/10.3103/S0278641911040030.pdf

Reference7 articles.

1. A. A. Voronenko, “On Checking Tests for Read-Once Functions,” in Mat. Vopr. Kibern., No. 11, 163–176 (2002).

2. A. A. Voronenko, “On the Length of Checking Test for Repetition-Free Functions in the Basis {0, 1, &, V, ¬},” Discrete Mathematics and Applications 15(3), 313–318 (2005).

3. L. V. Ryabets, Checking Test Complexity for Read-Once Boolean Functions, Discrete Mathematics and Informatics, Vol. 18 (Irkutsk. Gos. Ped. Univ., Irkutsk, 2007) [in Russian].

4. A. A. Voronenko and D. V. Chistikov, “Learning Read-Once Functions Individually,” Uch. Zap. Kazan. Gos. Univ., Ser. Fiz., Mat. 151(2), 36–44 (2009).

5. Faculty of Computational Mathematics and Cybernetics, MGU;S. E. Bubnov,2009

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

1. Testing Read-Once Functions in a Median-Augmented Element Basis;Computational Mathematics and Modeling;2021-04

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

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