{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:37:36Z","timestamp":1775054256283,"version":"3.50.1"},"publisher-location":"Cham","reference-count":9,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030199548","type":"print"},{"value":"9783030199555","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-19955-5_28","type":"book-chapter","created":{"date-parts":[[2019,6,23]],"date-time":"2019-06-23T23:10:01Z","timestamp":1561331401000},"page":"325-336","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Polynomial Time Delta-Decomposition Algorithm for Positive DNFs"],"prefix":"10.1007","author":[{"given":"Denis","family":"Ponomaryov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,16]]},"reference":[{"key":"28_CR1","series-title":"Encyclopedia of Mathematics and its Applications","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1017\/CBO9780511780448.005","volume-title":"Boolean Models and Methods in Mathematics, Computer Science, and Engineering","author":"JC Bioch","year":"2010","unstructured":"Bioch, J.C.: Decomposition of Boolean functions. In: Crama, Y., Hammer, P.L. (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering. Encyclopedia of Mathematics and its Applications, vol. 134, pp. 39\u201378. Cambridge University Press, New York (2010)"},{"key":"28_CR2","series-title":"Encyclopedia of Mathematics and its Applications","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1017\/CBO9780511780448.019","volume-title":"Boolean Models and Methods in Mathematics, Computer Science, and Engineering","author":"T Villa","year":"2010","unstructured":"Villa, T., Brayton, R.K., Sangiovanni-Vincentelli, A.: Synthesis of multilevel Boolean networks. In: Crama, Y., Hammer, P.L. (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering. Encyclopedia of Mathematics and its Applications, vol. 134, pp. 675\u2013722. Cambridge University Press, New York, NY, USA (2010)"},{"key":"28_CR3","series-title":"Encyclopedia of Mathematics and its Applications","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1017\/CBO9780511852008.007","volume-title":"Boolean Functions: Theory, Algorithms, and Applications","author":"E Boros","year":"2011","unstructured":"Boros, E.: Horn functions. In: Crama, Y., Hammer, P.L. (eds.) Boolean Functions: Theory, Algorithms, and Applications. Encyclopedia of Mathematics and its Applications, vol. 134, pp. 269\u2013325. Cambridge University Press, New York (2011)"},{"key":"28_CR4","unstructured":"Gursky, S.: Special classes of Boolean functions with respect to the complexity of their minimization. Ph.D. thesis, Charles University in Prague (2014)"},{"issue":"3","key":"28_CR5","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1134\/S0361768815030032","volume":"41","author":"P Emelyanov","year":"2015","unstructured":"Emelyanov, P., Ponomaryov, D.: Algorithmic issues of conjunctive decomposition of Boolean formulas. Program. Comput. Softw. 41(3), 162\u2013169 (2015)","journal-title":"Program. Comput. Softw."},{"key":"28_CR6","first-page":"111","volume":"28","author":"D Ponomaryov","year":"2008","unstructured":"Ponomaryov, D.: On decomposability in logical calculi. Bull. Novosib. Comput. Cent. 28, 111\u2013120 (2008)","journal-title":"Bull. Novosib. Comput. Cent."},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-662-46823-4_8","volume-title":"Perspectives of System Informatics","author":"P Emelyanov","year":"2015","unstructured":"Emelyanov, P., Ponomaryov, D.: On tractability of disjoint AND-decomposition of Boolean formulas. In: Voronkov, A., Virbitskaite, I. (eds.) PSI 2014. LNCS, vol. 8974, pp. 92\u2013101. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46823-4_8"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-642-14165-2_35","volume-title":"Automata, Languages and Programming","author":"A Shpilka","year":"2010","unstructured":"Shpilka, A., Volkovich, I.: On the relation between polynomial identity testing and finding variable disjoint factors. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6198, pp. 408\u2013419. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14165-2_35"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Crama, Y., Hammer, P.L.: Boolean Functions - Theory, Algorithms, and Applications. Encyclopedia of Mathematics and Its Applications, vol. 142. Cambridge University Press, Cambridge (2011)","DOI":"10.1017\/CBO9780511852008"}],"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-030-19955-5_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:03:34Z","timestamp":1710349414000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-19955-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030199548","9783030199555"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19955-5_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 May 2019","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":"Novosibirsk","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/logic.pdmi.ras.ru\/csr2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"44% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.27","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}