Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Bubnov, S.E., Voronenko, A.A., Chistikov, D.V.: Some test length bounds for nonrepeating functions in the
$\{\&, \lor\}$
basis. Computational Mathematics and Modeling 21(2), 196–205 (2010)
2. Chistikov, D.V.: Testing read-once functions over the elementary basis. Moscow University Computational Mathematics and Cybernetics (to appear)
3. Corneil, D.G., Lerchs, H., Stewart Burlingham, L.: Complement reducible graphs. Discrete Applied Mathematics 3(3), 163–174 (1981)
4. Gurvich, V.A.: On repetition-free Boolean functions. Uspehi Matematicheskih nauk 32(1), 183–184 (1977) (in Russian)
5. Karchmer, M., Linial, N., Newman, I., Saks, M., Widgerson, A.: Combinatorial characterization of read-once formulae. Discrete Mathematics 114(1-3), 275–282 (1993)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Checking Tests for Read-Once Functions over Arbitrary Bases;Computer Science – Theory and Applications;2012
2. An Upper Bound on Checking Test Complexity for Almost All Cographs;2011 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing;2011-09