{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:19:37Z","timestamp":1743103177334,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642250101"},{"type":"electronic","value":"9783642250118"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25011-8_10","type":"book-chapter","created":{"date-parts":[[2011,11,8]],"date-time":"2011-11-08T20:27:34Z","timestamp":1320784054000},"page":"121-134","source":"Crossref","is-referenced-by-count":2,"title":["Testing Monotone Read-Once Functions"],"prefix":"10.1007","author":[{"given":"Dmitry V.","family":"Chistikov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"10_CR1","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":"10_CR2","doi-asserted-by":"crossref","unstructured":"Chistikov, D.V.: Testing read-once functions over the elementary basis. Moscow University Computational Mathematics and Cybernetics (to appear)","DOI":"10.3103\/S0278641911040030"},{"issue":"3","key":"10_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D.G. Corneil","year":"1981","unstructured":"Corneil, D.G., Lerchs, H., Stewart Burlingham, L.: Complement reducible graphs. Discrete Applied Mathematics\u00a03(3), 163\u2013174 (1981)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"10_CR4","first-page":"183","volume":"32","author":"V.A. Gurvich","year":"1977","unstructured":"Gurvich, V.A.: On repetition-free Boolean functions. Uspehi Matematicheskih nauk\u00a032(1), 183\u2013184 (1977) (in Russian)","journal-title":"Uspehi Matematicheskih nauk"},{"issue":"1-3","key":"10_CR5","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0012-365X(93)90372-Z","volume":"114","author":"M. Karchmer","year":"1993","unstructured":"Karchmer, M., Linial, N., Newman, I., Saks, M., Widgerson, A.: Combinatorial characterization of read-once formulae. Discrete Mathematics\u00a0114(1-3), 275\u2013282 (1993)","journal-title":"Discrete Mathematics"},{"key":"10_CR6","unstructured":"Ryabets, L.V.: Checking test complexity for read-once Boolean functions. Ser. Diskretnaya matematika i informatika, vol.\u00a018. Izdatel\u2019stvo Irkutskogo gosudarstvennogo pedagogicheskogo universiteta (2007) (in Russian)"},{"key":"10_CR7","unstructured":"Sachkov, V.N.: Probabilistic methods in combinatorial analysis. Encyclopedia of Mathematics and its Applications, vol.\u00a056. Cambridge University Press (1997)"},{"issue":"4","key":"10_CR8","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1023\/B:COMI.0000047347.25080.e9","volume":"15","author":"A.A. Voronenko","year":"2004","unstructured":"Voronenko, A.A.: Estimating the length of a diagnostic test for some nonrepeating functions. Computational Mathematics and Modeling\u00a015(4), 377\u2013386 (2004)","journal-title":"Computational Mathematics and Modeling"},{"key":"10_CR9","unstructured":"Voronenko, A.A.: On checking tests for read-once functions. In: Matematicheskie Voprosy Kibernetiki, Fizmatlit, Moscow, vol.\u00a011, pp. 163\u2013176 (2002) (in Russian)"},{"issue":"3","key":"10_CR10","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1163\/156939205774464503","volume":"15","author":"A.A. Voronenko","year":"2005","unstructured":"Voronenko, A.A.: On the length of checking test for repetition-free functions in the basis \n                  \n                    \n                  \n                  $\\{0, 1, \\&, \\lor, \\neg\\}$\n                . Discrete Mathematics and Applications\u00a015(3), 313\u2013318 (2005)","journal-title":"Discrete Mathematics and Applications"},{"issue":"1","key":"10_CR11","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":"2","key":"10_CR12","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":"10_CR13","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 stvo Instituta matematiki, Novosibirsk (2008) (in Russian)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25011-8_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T01:22:57Z","timestamp":1555377777000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25011-8_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642250101","9783642250118"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25011-8_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}