{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:28:24Z","timestamp":1743024504855,"version":"3.40.3"},"publisher-location":"Cham","reference-count":6,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319905297"},{"type":"electronic","value":"9783319905303"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-90530-3_20","type":"book-chapter","created":{"date-parts":[[2018,4,24]],"date-time":"2018-04-24T07:23:53Z","timestamp":1524554633000},"page":"232-243","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Recognizing Read-Once Functions from Depth-Three Formulas"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9956-9023","authenticated-orcid":false,"given":"Alexander","family":"Kozachinskiy","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,25]]},"reference":[{"issue":"3","key":"20_CR1","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s10878-009-9283-0","volume":"22","author":"K Elbassioni","year":"2011","unstructured":"Elbassioni, K., Makino, K., Rauf, I.: On the readability of monotone Boolean formulae. J. Comb. Optim. 22(3), 293\u2013304 (2011)","journal-title":"J. Comb. Optim."},{"key":"20_CR2","unstructured":"Gurvich, V.: It is a coNP-complete problem to decide whether a positive $$\\vee $$-$$\\wedge $$ formula of depth 3 defines a read-once or respectively quadratic Boolean function. RUTCOR Research Report (2010)"},{"key":"20_CR3","unstructured":"Golumbic, M.C., Gurvich, V.: Read-once functions. In: Boolean Functions: Theory Algorithms and Applications (2009)"},{"issue":"10","key":"20_CR4","doi-asserted-by":"publisher","first-page":"1633","DOI":"10.1016\/j.dam.2008.02.011","volume":"156","author":"MC Golumbic","year":"2008","unstructured":"Golumbic, M.C., Mintz, A., Rotics, U.: An improvement on the complexity of factoring read-once Boolean functions. Discrete Appl. Math. 156(10), 1633\u20131636 (2008)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"20_CR5","first-page":"183","volume":"32","author":"VA Gurvich","year":"1977","unstructured":"Gurvich, V.A.: Repetition-free Boolean functions. Usp. Mat. Nauk 32(1), 183\u2013184 (1977)","journal-title":"Usp. Mat. Nauk"},{"key":"20_CR6","volume-title":"Propositional Logic: Deduction and Algorithms","author":"H B\u00fcning","year":"1999","unstructured":"B\u00fcning, H., Lettmann, T.: Propositional Logic: Deduction and Algorithms, vol. 48. Cambridge University Press, Cambridge (1999)"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-90530-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T11:30:39Z","timestamp":1710243039000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-90530-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319905297","9783319905303"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-90530-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"25 April 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}