Abstract
A Boolean function is called read-once over a basis B if it can be expressed by a formula over B where no variable appears more than once. A checking test for a read-once function f over B depending on all its variables is a set of input vectors distinguishing f from all other read-once functions of the same variables. We show that every read-once function f over B has a checking test containing O(n l) vectors, where n is the number of relevant variables of f and l is the largest arity of functions in B. For some functions, this bound cannot be improved by more than a constant factor. The employed technique involves reconstructing f from its l-variable projections and provides a stronger form of Kuznetsov’s classic theorem on read-once representations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aaronson, S.: Algorithms for Boolean function query properties. SIAM Journal on Computing 32(5), 1140–1157 (2003)
Angluin, D.: Queries and concept learning. Machine Learning 2(4), 319–342 (1988)
Angluin, D., Hellerstein, L., Karpinski, M.: Learning read-once formulas with queries. Journal of the ACM 40, 185–210 (1993)
Bshouty, N.H., Hancock, T.R., Hellerstein, L.: Learning Boolean read-once formulas over generalized bases. Journal of Computer and System Sciences 50(3), 521–542 (1995)
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)
Chegis, I.A., Yablonsky, S.V.: Logical methods for controlling electrical circuits. Trudy Matematicheskogo Instituta Steklova 51, 270–360 (1958) (in Russian)
Chistikov, D.V.: On the relationship between diagnostic and checking tests of the read-once functions. Discrete Mathematics and Applications 21(2), 203–208 (2011)
Chistikov, D.V.: Read-once functions with hard-to-test projections. Moscow University Computational Mathematics and Cybernetics 34(4), 188–190 (2010)
Chistikov, D.V.: Testing Monotone Read-Once Functions. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2011. LNCS, vol. 7056, pp. 121–134. Springer, Heidelberg (2011)
Chistikov, D.V.: Testing read-once functions over the elementary basis. Moscow University Computational Mathematics and Cybernetics 35(4), 189–192 (2011)
Davies, R.O.: Two theorems on essential variables. Journal of the London Mathematical Society 41(2), 333–335 (1966)
Goldman, S.A., Kearns, M.J.: On the complexity of teaching. Journal of Computer and System Sciences 50(1), 20–31 (1995)
Kuznetsov, A.V.: On read-once switching circuits and read-once compositions of functions in the algebra of logic. Trudy Matematicheskogo Instituta Steklova 51, 186–225 (1958) (in Russian)
Voronenko, A.A.: On checking tests for read-once functions. In: Matematicheskie Voprosy Kibernetiki, vol. 11, pp. 163–176. Fizmatlit, Moscow (2002) (in Russian)
Voronenko, A.A.: Recognizing the nonrepeating property in an arbitrary basis. Computational Mathematics and Modeling 18(1), 55–65 (2007)
Voronenko, A.A.: Testing disjunction as a read-once function in an arbitrary unrepeated basis. Moscow University Computational Mathematics and Cybernetics 32(4), 239–240 (2008)
Voronenko, A.A., Chistikov, D.V.: Learning read-once functions individually. Uchenye Zapiski Kazanskogo Universiteta, ser. Fiziko-Matematicheskie Nauki 151(2), 36–44 (2009) (in Russian)
Voronenko, A.A., Chistikov, D.V.: On testing read-once Boolean functions in the basis B 5. In: Proceedings of the XVII International Workshop “Synthesis and Complexity of Control Systems”, pp. 24–30. Izdatel’stvo Instituta matematiki, Novosibirsk (2008) (in Russian)
Zubkov, O.V., Chistikov, D.V., Voronenko, A.A.: An upper bound on checking test complexity for almost all cographs. In: Wang, D., et al. (eds.) 13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2011), pp. 323–330. IEEE Computer Society, Los Alamitos (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chistikov, D.V. (2012). Checking Tests for Read-Once Functions over Arbitrary Bases. In: Hirsch, E.A., Karhumäki, J., Lepistö, A., Prilutskii, M. (eds) Computer Science – Theory and Applications. CSR 2012. Lecture Notes in Computer Science, vol 7353. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-30642-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-30642-6_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-30641-9
Online ISBN: 978-3-642-30642-6
eBook Packages: Computer ScienceComputer Science (R0)