{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:37:31Z","timestamp":1775054251208,"version":"3.50.1"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319986531","type":"print"},{"value":"9783319986548","type":"electronic"}],"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-99639-4_11","type":"book-chapter","created":{"date-parts":[[2018,8,22]],"date-time":"2018-08-22T15:43:34Z","timestamp":1534952614000},"page":"164-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On a Polytime Factorization Algorithm for Multilinear Polynomials over $$\\mathbb {F}_2$$"],"prefix":"10.1007","author":[{"given":"Pavel","family":"Emelyanov","sequence":"first","affiliation":[]},{"given":"Denis","family":"Ponomaryov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,23]]},"reference":[{"issue":"2","key":"11_CR1","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1023\/A:1018373005182","volume":"10","author":"M Akra","year":"1998","unstructured":"Akra, M., Bazzi, L.: On the solution of linear recurrence equations. Comput. Optim. Appl. 10(2), 195\u2013210 (1998). \n                    https:\/\/doi.org\/10.1023\/A:1018373005182","journal-title":"Comput. Optim. Appl."},{"key":"11_CR2","doi-asserted-by":"publisher","unstructured":"de Kleine, J., Monagan, M.B., Wittkopf, A.D.: Algorithms for the non-monic case of the sparse modular GCD algorithm. In: Proceedings of 2005 International Symposium on Symbolic and Algebraic Computation (ISSAC 2005), pp. 124\u2013131. ACM, New York (2005). \n                    https:\/\/doi.org\/10.1145\/1073884.1073903","DOI":"10.1145\/1073884.1073903"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-319-29221-2_14","volume-title":"Algorithms and Discrete Applied Mathematics","author":"P Emelyanov","year":"2016","unstructured":"Emelyanov, P.: AND\u2013decomposition of boolean polynomials with prescribed shared variables. In: Govindarajan, S., Maheshwari, A. (eds.) CALDAM 2016. LNCS, vol. 9602, pp. 164\u2013175. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-29221-2_14"},{"key":"11_CR4","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). \n                    https:\/\/doi.org\/10.1007\/978-3-319-93701-4_13"},{"issue":"3","key":"11_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 AND-decomposition of Boolean formulas. Program. Comput. Softw. 41(3), 162\u2013169 (2015). \n                    https:\/\/doi.org\/10.1134\/S0361768815030032\n                    \n                  . Trans. by: Programmirovanie 41(3), 62\u201372 (2015)","journal-title":"Program. Comput. Softw."},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Emelyanov, P., Ponomaryov, D.: Cartesian decomposition in data analysis. In: Proceedings of Siberian Symposium on Data Science and Engineering (SSDSE 2017), Novosibirsk, Russia, pp. 55\u201360 (2017). \n                    https:\/\/doi.org\/10.1109\/SSDSE.2017.8071964","DOI":"10.1109\/SSDSE.2017.8071964"},{"key":"11_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). \n                    https:\/\/doi.org\/10.1007\/978-3-662-46823-4_8"},{"key":"11_CR8","unstructured":"Grigoriev, D.: Theory of Complexity of Computations. II. Notes of Scientific Seminars of LOMI (Zapiski Nauchn. Semin. Leningr. Otdel. Matem. Inst. Acad. Sci. USSR). Nauka, Leningrad, vol. 137, pp. 20\u201379 (1984). (in Russian)"},{"key":"11_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7518-8","volume-title":"Advanced Techniques in Logic Synthesis, Optimizations and Applications","year":"2011","unstructured":"Khatri, S.P., Gulati, K. (eds.): Advanced Techniques in Logic Synthesis, Optimizations and Applications. Springer, New York (2011). \n                    https:\/\/doi.org\/10.1007\/978-1-4419-7518-8"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Muller, D.E.: Application of Boolean algebra to switching circuit design and to error detection. IRE Trans. Electron. Comput. EC-3, 6\u201312 (1954)","DOI":"10.1109\/IREPGELC.1954.6499441"},{"key":"11_CR11","unstructured":"Perkowski, M.A., Grygiel, S.: A survey of literature on function decomposition, Version IV. PSU Electrical Engineering Department Report, Portland State University, Portland, Oregon, USA, November 1995"},{"key":"11_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-1806-4","volume-title":"Computational and Algorithmic Problems in Finite Fields","author":"IE Shparlinski","year":"1992","unstructured":"Shparlinski, I.E.: Computational and Algorithmic Problems in Finite Fields. Springer, New York (1992). \n                    https:\/\/doi.org\/10.1007\/978-94-011-1806-4"},{"key":"11_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). \n                    https:\/\/doi.org\/10.1007\/978-3-642-14165-2_35"},{"key":"11_CR14","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., Gerhard, J.: Modern Computer Algebra, 3rd edn. Cambridge University Press, New York (2013). \n                    https:\/\/doi.org\/10.1017\/CBO9781139856065","edition":"3"},{"issue":"1","key":"11_CR15","first-page":"311","volume":"35","author":"I Zhegalkin","year":"1928","unstructured":"Zhegalkin, I.: Arithmetization of symbolic logics. Sbornik Mathematics 35(1), 311\u2013377 (1928). (in Russian)","journal-title":"Sbornik Mathematics"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99639-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,9,2]],"date-time":"2018-09-02T20:37:22Z","timestamp":1535920642000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-99639-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319986531","9783319986548"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99639-4_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}