{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:27:54Z","timestamp":1743002874867,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030374860"},{"type":"electronic","value":"9783030374877"}],"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-37487-7_7","type":"book-chapter","created":{"date-parts":[[2019,12,13]],"date-time":"2019-12-13T04:22:10Z","timestamp":1576210930000},"page":"80-94","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Parallel Factorization of Boolean Polynomials"],"prefix":"10.1007","author":[{"given":"Vadiraj","family":"Kulkarni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavel","family":"Emelyanov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Denis","family":"Ponomaryov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Madhava","family":"Krishna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soumyendu","family":"Raha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. K.","family":"Nandy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,12,16]]},"reference":[{"key":"7_CR1","unstructured":"Redefine - reconfigurable silicon core description. \nhttp:\/\/morphing.in\/redefine\n\n. Accessed 07 Dec 2018"},{"issue":"3","key":"7_CR2","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1109\/54.867894","volume":"17","author":"F Corno","year":"2000","unstructured":"Corno, F., Reorda, M., Squillero, G.: RT-level ITC\u201999 benchmarks and first atpg results. IEEE Design Test Comput. 17(3), 44\u201353 (2000). \nhttps:\/\/doi.org\/10.1109\/54.867894","journal-title":"IEEE Design Test Comput."},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-319-93701-4_13","volume-title":"Computational Science \u2013 ICCS 2018","author":"P Emelyanov","year":"2018","unstructured":"Emelyanov, P.: On two kinds of dataset decomposition. In: Shi, Y., et al. (eds.) ICCS 2018. LNCS, vol. 10861, pp. 171\u2013183. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-93701-4_13"},{"issue":"3","key":"7_CR4","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 AND-decomposition of boolean formulas. Programm. Comput. Softw. 41(3), 162\u2013169 (2015)","journal-title":"Programm. Comput. Softw."},{"key":"7_CR5","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). \nhttps:\/\/doi.org\/10.1007\/978-3-662-46823-4_8"},{"key":"7_CR6","doi-asserted-by":"crossref","unstructured":"Emelyanov, P., Ponomaryov, D.: Cartesian decomposition in data analysis. In: Siberian Symposium on Data Science and Engineering (SSDSE) (2017)","DOI":"10.1109\/SSDSE.2017.8071964"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-319-99639-4_11","volume-title":"Computer Algebra in Scientific Computing","author":"P Emelyanov","year":"2018","unstructured":"Emelyanov, P., Ponomaryov, D.: On a polytime factorization algorithm for multilinear polynomials over $$\\mathbb{F}_2$$. In: Gerdt, V.P., Koepf, W., Seiler, W.M., Vorozhtsov, E.V. (eds.) CASC 2018. LNCS, vol. 11077, pp. 164\u2013176. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-99639-4_11"},{"key":"7_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139856065","volume-title":"Modern Computer Algebra","author":"J Gathen von zur","year":"2013","unstructured":"von zur Gathen, J., Gerhard, J.: Modern Computer Algebra, 3rd edn. Cambridge University Press, New York (2013)","edition":"3"},{"issue":"3","key":"7_CR9","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1109\/54.785838","volume":"16","author":"MC Hansen","year":"1999","unstructured":"Hansen, M.C., Yalcin, H., Hayes, J.P.: Unveiling the ISCAS-85 benchmarks: a case study in reverse engineering. IEEE Des. Test 16(3), 72\u201380 (1999). \nhttps:\/\/doi.org\/10.1109\/54.785838","journal-title":"IEEE Des. Test"},{"key":"7_CR10","first-page":"6","volume":"EC\u20133","author":"DE Muller","year":"1954","unstructured":"Muller, D.E.: Application of boolean algebra to switching circuit design and to error detection. IRE Trans. Electron. Comput. EC\u20133, 6\u201312 (1954)","journal-title":"IRE Trans. Electron. Comput."},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-030-19955-5_28","volume-title":"Computer Science \u2013 Theory and Applications","author":"D Ponomaryov","year":"2019","unstructured":"Ponomaryov, D.: A polynomial time delta-decomposition algorithm for positive DNFs. In: van Bevern, R., Kucherov, G. (eds.) CSR 2019. LNCS, vol. 11532, pp. 325\u2013336. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-19955-5_28"},{"key":"7_CR12","unstructured":"Schmidt, J., Fi\u0161er, P.: A prudent approach to benchmark collection"},{"key":"7_CR13","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-14165-2_35"},{"issue":"1","key":"7_CR14","first-page":"311","volume":"35","author":"I Zhegalkin","year":"1928","unstructured":"Zhegalkin, I.: Arithmetization of symbolic logics. Sbornik Math. 35(1), 311\u2013377 (1928). (in Russian)","journal-title":"Sbornik Math."}],"container-title":["Lecture Notes in Computer Science","Perspectives of System Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-37487-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,15]],"date-time":"2019-12-15T19:03:39Z","timestamp":1576436619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-37487-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030374860","9783030374877"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-37487-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"16 December 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PSI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Andrei Ershov Memorial Conference on Perspectives of System Informatics","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":"2 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":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ershov2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/psi.nsc.ru\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}