{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T15:43:55Z","timestamp":1725464635887},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642306419"},{"type":"electronic","value":"9783642306426"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30642-6_6","type":"book-chapter","created":{"date-parts":[[2012,8,11]],"date-time":"2012-08-11T04:01:39Z","timestamp":1344657699000},"page":"52-63","source":"Crossref","is-referenced-by-count":2,"title":["Checking Tests for Read-Once Functions over Arbitrary Bases"],"prefix":"10.1007","author":[{"given":"Dmitry V.","family":"Chistikov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5","key":"6_CR1","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1137\/S0097539700379644","volume":"32","author":"S. Aaronson","year":"2003","unstructured":"Aaronson, S.: Algorithms for Boolean function query properties. SIAM Journal on Computing\u00a032(5), 1140\u20131157 (2003)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"6_CR2","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"Angluin, D.: Queries and concept learning. Machine Learning\u00a02(4), 319\u2013342 (1988)","journal-title":"Machine Learning"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1145\/138027.138061","volume":"40","author":"D. Angluin","year":"1993","unstructured":"Angluin, D., Hellerstein, L., Karpinski, M.: Learning read-once formulas with queries. Journal of the ACM\u00a040, 185\u2013210 (1993)","journal-title":"Journal of the ACM"},{"issue":"3","key":"6_CR4","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1006\/jcss.1995.1042","volume":"50","author":"N.H. Bshouty","year":"1995","unstructured":"Bshouty, N.H., Hancock, T.R., Hellerstein, L.: Learning Boolean read-once formulas over generalized bases. Journal of Computer and System Sciences\u00a050(3), 521\u2013542 (1995)","journal-title":"Journal of Computer and System Sciences"},{"issue":"2","key":"6_CR5","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/s10598-010-9064-8","volume":"21","author":"S.E. Bubnov","year":"2010","unstructured":"Bubnov, S.E., Voronenko, A.A., Chistikov, D.V.: Some test length bounds for nonrepeating functions in the \n                    \n                      \n                    \n                    $\\{\\&, \\lor\\}$\n                   basis. Computational Mathematics and Modeling\u00a021(2), 196\u2013205 (2010)","journal-title":"Computational Mathematics and Modeling"},{"key":"6_CR6","first-page":"270","volume":"51","author":"I.A. Chegis","year":"1958","unstructured":"Chegis, I.A., Yablonsky, S.V.: Logical methods for controlling electrical circuits. Trudy Matematicheskogo Instituta Steklova\u00a051, 270\u2013360 (1958) (in Russian)","journal-title":"Trudy Matematicheskogo Instituta Steklova"},{"issue":"2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1515\/dma.2011.012","volume":"21","author":"D.V. Chistikov","year":"2011","unstructured":"Chistikov, D.V.: On the relationship between diagnostic and checking tests of the read-once functions. Discrete Mathematics and Applications\u00a021(2), 203\u2013208 (2011)","journal-title":"Discrete Mathematics and Applications"},{"issue":"4","key":"6_CR8","doi-asserted-by":"publisher","first-page":"188","DOI":"10.3103\/S0278641910040060","volume":"34","author":"D.V. Chistikov","year":"2010","unstructured":"Chistikov, D.V.: Read-once functions with hard-to-test projections. Moscow University Computational Mathematics and Cybernetics\u00a034(4), 188\u2013190 (2010)","journal-title":"Moscow University Computational Mathematics and Cybernetics"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-642-25011-8_10","volume-title":"Combinatorial Algorithms","author":"D.V. Chistikov","year":"2011","unstructured":"Chistikov, D.V.: Testing Monotone Read-Once Functions. In: Iliopoulos, C.S., Smyth, W.F. (eds.) IWOCA 2011. LNCS, vol.\u00a07056, pp. 121\u2013134. Springer, Heidelberg (2011)"},{"issue":"4","key":"6_CR10","doi-asserted-by":"publisher","first-page":"189","DOI":"10.3103\/S0278641911040030","volume":"35","author":"D.V. Chistikov","year":"2011","unstructured":"Chistikov, D.V.: Testing read-once functions over the elementary basis. Moscow University Computational Mathematics and Cybernetics\u00a035(4), 189\u2013192 (2011)","journal-title":"Moscow University Computational Mathematics and Cybernetics"},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1112\/jlms\/s1-41.1.333","volume":"41","author":"R.O. Davies","year":"1966","unstructured":"Davies, R.O.: Two theorems on essential variables. Journal of the London Mathematical Society\u00a041(2), 333\u2013335 (1966)","journal-title":"Journal of the London Mathematical Society"},{"issue":"1","key":"6_CR12","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1006\/jcss.1995.1003","volume":"50","author":"S.A. Goldman","year":"1995","unstructured":"Goldman, S.A., Kearns, M.J.: On the complexity of teaching. Journal of Computer and System Sciences\u00a050(1), 20\u201331 (1995)","journal-title":"Journal of Computer and System Sciences"},{"key":"6_CR13","first-page":"186","volume":"51","author":"A.V. Kuznetsov","year":"1958","unstructured":"Kuznetsov, A.V.: On read-once switching circuits and read-once compositions of functions in the algebra of logic. Trudy Matematicheskogo Instituta Steklova\u00a051, 186\u2013225 (1958) (in Russian)","journal-title":"Trudy Matematicheskogo Instituta Steklova"},{"key":"6_CR14","first-page":"163","volume-title":"Matematicheskie Voprosy Kibernetiki","author":"A.A. Voronenko","year":"2002","unstructured":"Voronenko, A.A.: On checking tests for read-once functions. In: Matematicheskie Voprosy Kibernetiki, vol.\u00a011, pp. 163\u2013176. Fizmatlit, Moscow (2002) (in Russian)"},{"issue":"1","key":"6_CR15","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10598-007-0006-z","volume":"18","author":"A.A. Voronenko","year":"2007","unstructured":"Voronenko, A.A.: Recognizing the nonrepeating property in an arbitrary basis. Computational Mathematics and Modeling\u00a018(1), 55\u201365 (2007)","journal-title":"Computational Mathematics and Modeling"},{"issue":"4","key":"6_CR16","doi-asserted-by":"publisher","first-page":"239","DOI":"10.3103\/S0278641908040080","volume":"32","author":"A.A. Voronenko","year":"2008","unstructured":"Voronenko, A.A.: Testing disjunction as a read-once function in an arbitrary unrepeated basis. Moscow University Computational Mathematics and Cybernetics\u00a032(4), 239\u2013240 (2008)","journal-title":"Moscow University Computational Mathematics and Cybernetics"},{"issue":"2","key":"6_CR17","first-page":"36","volume":"151","author":"A.A. Voronenko","year":"2009","unstructured":"Voronenko, A.A., Chistikov, D.V.: Learning read-once functions individually. Uchenye Zapiski Kazanskogo Universiteta, ser. Fiziko-Matematicheskie Nauki\u00a0151(2), 36\u201344 (2009) (in Russian)","journal-title":"Uchenye Zapiski Kazanskogo Universiteta, ser. Fiziko-Matematicheskie Nauki"},{"key":"6_CR18","first-page":"24","volume-title":"Proceedings of the XVII International Workshop \u201cSynthesis and Complexity of Control Systems\u201d","author":"A.A. Voronenko","year":"2008","unstructured":"Voronenko, A.A., Chistikov, D.V.: On testing read-once Boolean functions in the basis B\n                  5. In: Proceedings of the XVII International Workshop \u201cSynthesis and Complexity of Control Systems\u201d, pp. 24\u201330. Izdatel\u2019stvo Instituta matematiki, Novosibirsk (2008) (in Russian)"},{"key":"6_CR19","first-page":"323","volume-title":"13th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2011)","author":"O.V. Zubkov","year":"2012","unstructured":"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\u2013330. IEEE Computer Society, Los Alamitos (2012)"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30642-6_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:47:52Z","timestamp":1620114472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30642-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642306419","9783642306426"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30642-6_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}