{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:18:17Z","timestamp":1775017097702,"version":"3.50.1"},"reference-count":15,"publisher":"Pleiades Publishing Ltd","issue":"2","license":[{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Program Comput Soft"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1134\/s0361768821020043","type":"journal-article","created":{"date-parts":[[2021,4,16]],"date-time":"2021-04-16T09:16:56Z","timestamp":1618564616000},"page":"108-118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Factorization of Boolean Polynomials: Parallel Algorithms and Experimental Evaluation"],"prefix":"10.1134","volume":"47","author":[{"given":"P. G.","family":"Emelyanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Krishna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V.","family":"Kulkarni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. K.","family":"Nandy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D. K.","family":"Ponomaryov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Raha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2021,4,16]]},"reference":[{"key":"3579_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139856065","volume-title":"Modern Computer Algebra","author":"J. von zur Gathen","year":"2013","unstructured":"von zur Gathen, J. and Gerhard, J., Modern Computer Algebra, Cambridge University Press, 2013, 3rd ed."},{"key":"3579_CR2","first-page":"311","volume":"35","author":"I.I. Zhegalkin","year":"1928","unstructured":"Zhegalkin, I.I., Arithmetization of symbolic logic, Mat. Sb., 1928, vol. 35, no. 1, pp. 311\u2013377.","journal-title":"Mat. Sb."},{"key":"3579_CR3","first-page":"6","volume":"EC-3","author":"D.E. Muller","year":"1954","unstructured":"Muller, D.E., Application of Boolean algebra to switching circuit design and to error detection, IRE Trans. Electron. Comput., 1954, vol. EC-3, pp. 6\u201312.","journal-title":"IRE Trans. Electron. Comput."},{"key":"3579_CR4","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1134\/S0361768815030032","volume":"41","author":"P.G. Emelyanov","year":"2015","unstructured":"Emelyanov, P.G. and Ponomaryov, D.K., Algorithmic issues of AND-decomposition of Boolean formulas, Program. Comput. Software, 2015, vol. 41, pp. 162\u2013169.","journal-title":"Program. Comput. Software"},{"key":"3579_CR5","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-662-46823-4_8","volume":"8974","author":"P. Emelyanov","year":"2015","unstructured":"Emelyanov, P. and Ponomaryov, D., On tractability of disjoint AND-decomposition of Boolean formulas, Lect. Notes Comput. Sci., 2015, vol. 8974, pp. 92\u2013101.","journal-title":"Lect. Notes Comput. Sci."},{"key":"3579_CR6","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-319-93701-4_13","volume":"10861","author":"P. Emelyanov","year":"2018","unstructured":"Emelyanov, P., On two kinds of dataset decomposition, Lect. Notes Comput. Sci., 2018, vol. 10861, pp. 171\u2013183.","journal-title":"Lect. Notes Comput. Sci."},{"key":"3579_CR7","doi-asserted-by":"crossref","unstructured":"Emelyanov, P. and Ponomaryov, D., Cartesian decomposition in data analysis, Proc. Siberian Symp. Data Science and Engineering (SSDSE), 2017, pp. 55\u201360.","DOI":"10.1109\/SSDSE.2017.8071964"},{"key":"3579_CR8","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-642-14165-2_35","volume":"6198","author":"A. Shpilka","year":"2010","unstructured":"Shpilka, A. and Volkovich, I., On the relation between polynomial identity testing and finding variable disjoint factors, Lect. Notes Comput. Sci., 2010, vol. 6198, pp.\u00a0408\u2013419.","journal-title":"Lect. Notes Comput. Sci."},{"key":"3579_CR9","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-319-99639-4_11","volume":"11077","author":"P. Emelyanov","year":"2018","unstructured":"Emelyanov, P. and Ponomaryov, D., On a polytime factorization algorithm for multilinear polynomials over F\n               2, Lect. Notes Comput. Sci., 2018, vol. 11077, pp.\u00a0164\u2013176.","journal-title":"Lect. Notes Comput. Sci."},{"key":"3579_CR10","unstructured":"Somenzi, F., CUDD: CU decision diagram package. https:\/\/github.com\/ivmai\/cudd. Accessed December 11, 2019."},{"key":"3579_CR11","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1109\/54.867894","volume":"17","author":"F. Corno","year":"2000","unstructured":"Corno, F., Reorda, M.S., and Squillero, G., RT-level ITC'99 benchmarks and first ATPG results, IEEE Des. Test Comput., 2000, vol. 17, no. 3, pp. 44\u201353.","journal-title":"IEEE Des. Test Comput."},{"key":"3579_CR12","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1109\/54.785838","volume":"16","author":"M.C. Hansen","year":"1999","unstructured":"Hansen, M.C., Yalcin, H., and Hayes, J.P., Unveiling the ISCAS-85 benchmarks: A case study in reverse engineering, IEEE Des. Test Comput., 1999, vol. 16, no. 3, pp. 72\u201380.","journal-title":"IEEE Des. Test Comput."},{"key":"3579_CR13","unstructured":"Fi\u0161er, P. and Schmidt, J., A prudent approach to benchmark collection, Proc. 12th Int. Workshop Boolean Problems (IWSBP), 2016, pp. 129\u2013136."},{"key":"3579_CR14","unstructured":"Redefine: Reconfigurable silicon core description. http:\/\/morphing.in\/redefine. Accessed December 7, 2018."},{"key":"3579_CR15","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-030-19955-5_28","volume":"11532","author":"D. Ponomaryov","year":"2019","unstructured":"Ponomaryov, D., A polynomial time delta-decomposition algorithm for positive DNFs, Lect. Notes Comput. Sci., 2019, vol. 11532, pp. 325\u2013336.","journal-title":"Lect. Notes Comput. Sci."}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768821020043.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0361768821020043","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0361768821020043.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:42:11Z","timestamp":1775011331000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0361768821020043"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["3579"],"URL":"https:\/\/doi.org\/10.1134\/s0361768821020043","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3]]},"assertion":[{"value":"2 April 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 April 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}