{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:37:37Z","timestamp":1762508257457,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030600259"},{"type":"electronic","value":"9783030600266"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-60026-6_21","type":"book-chapter","created":{"date-parts":[[2020,10,17]],"date-time":"2020-10-17T20:02:36Z","timestamp":1602964956000},"page":"368-389","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Nullstellensatz-Proofs for Multiplier Verification"],"prefix":"10.1007","author":[{"given":"Daniela","family":"Kaufmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Armin","family":"Biere","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,2]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Atserias, A., Ochremiak, J.: Proof complexity meets algebra. ACM Trans. Comput. Log. 20(1), 1:1\u20131:46 (2019)","DOI":"10.1145\/3265985"},{"issue":"1","key":"21_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1006\/jcss.1998.1575","volume":"57","author":"P Beame","year":"1998","unstructured":"Beame, P., Cook, S.A., Edmonds, J., Impagliazzo, R., Pitassi, T.: The relative complexity of NP search problems. J. Comput. Syst. Sci. 57(1), 3\u201319 (1998)","journal-title":"J. Comput. Syst. Sci."},{"key":"21_CR3","doi-asserted-by":"crossref","unstructured":"Beame, P., Impagliazzo, R., Kraj\u00edcek, J., Pitassi, T., Pudl\u00e1k, P.: Lower bounds on Hilbert\u2019s Nullstellensatz and propositional proofs. In: Proceedings of the London Mathematical Society, vol. s3-73, pp. 1\u201326 (1996)","DOI":"10.1112\/plms\/s3-73.1.1"},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Becker, T., Weispfenning, V., Kredel, H.: Gr\u00f6bner Bases. Graduate texts in mathematics, vol. 141. Springer, Heidelberg (1993)","DOI":"10.1007\/978-1-4612-0913-3_5"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Bright, C., Kotsireas, I., Ganesh, V.: Applying computer algebra systems and SAT solvers to the Williamson conjecture. J. Symb. Comput. (2019, in press)","DOI":"10.1016\/j.jsc.2019.07.024"},{"key":"21_CR6","unstructured":"Bright, C., Kotsireas, I., Ganesh, V.: SAT solvers and computer algebra systems: a powerful combination for mathematics. CoRR abs\/1907.04408 (2019)"},{"key":"21_CR7","unstructured":"Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. Ph.D. thesis, University of Innsbruck (1965)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Choo, D., Soos, M., Chai, K.M.A., Meel, K.S.: Bosphorus: bridging ANF and CNF solvers. In: DATE 2019, pp. 468\u2013473. IEEE (2019). https:\/\/doi.org\/10.23919\/DATE.2019.8715061","DOI":"10.23919\/DATE.2019.8715061"},{"key":"21_CR9","unstructured":"Ciesielski, M.J., Su, T., Yasin, A., Yu, C.: Understanding algebraic rewriting for arithmetic circuit verification: a bit-flow model. IEEE TCAD 1 (2019). Early acces"},{"key":"21_CR10","doi-asserted-by":"crossref","unstructured":"Clegg, M., Edmonds, J., Impagliazzo, R.: Using the Groebner basis algorithm to find proofs of unsatisfiability. In: STOC 1996, pp. 174\u2013183. ACM (1996)","DOI":"10.1145\/237814.237860"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-319-63046-5_14","volume-title":"Automated Deduction \u2013 CADE 26","author":"L Cruz-Filipe","year":"2017","unstructured":"Cruz-Filipe, L., Heule, M.J.H., Hunt, W.A., Kaufmann, M., Schneider-Kamp, P.: Efficient certified RAT verification. In: de Moura, L. (ed.) CADE 2017. LNCS (LNAI), vol. 10395, pp. 220\u2013236. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63046-5_14"},{"key":"21_CR12","unstructured":"Decker, W., Greuel, G.M., Pfister, G., Sch\u00f6nemann, H.: Singular 4-1-0 \u2013 a computer algebra system for polynomial computations (2016). http:\/\/www.singular.uni-kl.de"},{"key":"21_CR13","unstructured":"Gelder, A.V.: Verifying RUP proofs of propositional unsatisfiability. In: ISAIM 2008 (2008)"},{"issue":"4","key":"21_CR14","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/s10472-012-9322-x","volume":"65","author":"AV Gelder","year":"2012","unstructured":"Gelder, A.V.: Producing and verifying extremely large propositional refutations - have your cake and eat it too. Ann. Math. Artif. Intell. 65(4), 329\u2013372 (2012)","journal-title":"Ann. Math. Artif. Intell."},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/3-540-45465-9_23","volume-title":"Automata, Languages and Programming","author":"D Grigoriev","year":"2002","unstructured":"Grigoriev, D., Hirsch, E.A., Pasechnik, D.V.: Exponential lower bound for static semi-algebraic proofs. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 257\u2013268. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45465-9_23"},{"key":"21_CR16","unstructured":"Heule, M.J.H.: Computing small unit-distance graphs with chromatic number 5. CoRR abs\/1805.12181 (2018)"},{"key":"21_CR17","unstructured":"Heule, M.J.H., Biere, A.: Proofs for satisfiability problems. In: All about Proofs, Proofs for All Workshop, APPA 2014. vol. 55, pp. 1\u201322. College Publications (2015)"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Heule, M.J.H., Jr., W.A.H., Wetzler, N.: Trimming while checking clausal proofs. In: FMCAD 2013, pp. 181\u2013188. IEEE (2013)","DOI":"10.1109\/FMCAD.2013.6679408"},{"key":"21_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-030-24258-9_10","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2019","author":"MJH Heule","year":"2019","unstructured":"Heule, M.J.H., Kauers, M., Seidl, M.: Local search for fast matrix multiplication. In: Janota, M., Lynce, I. (eds.) SAT 2019. LNCS, vol. 11628, pp. 155\u2013163. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24258-9_10"},{"key":"21_CR20","unstructured":"Heule, M.J.H., Kauers, M., Seidl, M.: New ways to multiply $$3\\times 3$$-matrices. CoRR abs\/1905.10192 (2019)"},{"key":"21_CR21","doi-asserted-by":"crossref","unstructured":"Homma, N., Watanabe, Y., Aoki, T., Higuchi, T.: Formal design of arithmetic circuits based on arithmetic description language. IEICE Trans. 89-A(12), 3500\u20133509 (2006)","DOI":"10.1093\/ietfec\/e89-a.12.3500"},{"issue":"2","key":"21_CR22","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s000370050024","volume":"8","author":"R Impagliazzo","year":"1999","unstructured":"Impagliazzo, R., Pudl\u00e1k, P., Sgall, J.: Lower bounds for the polynomial calculus and the Gr\u00f6bner basis algorithm. Comput. Complex. 8(2), 127\u2013144 (1999)","journal-title":"Comput. Complex."},{"key":"21_CR23","unstructured":"Kaufmann, D.: Formal verification of multiplier circuits using computer algebra. Ph.D. thesis, Informatik, Johannes Kepler University Linz (2020)"},{"key":"21_CR24","doi-asserted-by":"crossref","unstructured":"Kaufmann, D., Biere, A., Kauers, M.: Verifying large multipliers by combining SAT and computer algebra. In: FMCAD 2019, pp. 28\u201336. IEEE (2019)","DOI":"10.23919\/FMCAD.2019.8894250"},{"key":"21_CR25","doi-asserted-by":"crossref","unstructured":"Kaufmann, D., Biere, A., Kauers, M.: From DRUP to PAC and back. In: DATE 2020, pp. 654\u2013657. IEEE (2020)","DOI":"10.23919\/DATE48585.2020.9116276"},{"key":"21_CR26","unstructured":"Kaufmann, D., Biere, A., Kauers, M.: SAT, computer algebra, multipliers. In: Vampire 2018 and Vampire 2019. EPiC Series in Computing, vol. 71, pp. 1\u201318. EasyChair (2020)"},{"key":"21_CR27","unstructured":"Kaufmann, D., Fleury, M., Biere, A.: Pacheck and Past\u00e8que, checking practical algebraic calculus proofs. In: FMCAD 2020. IEEE (2020, to appear). http:\/\/fmv.jku.at\/pacheck_pasteque\/,"},{"issue":"12","key":"21_CR28","first-page":"1377","volume":"21","author":"A Kuehlmann","year":"2002","unstructured":"Kuehlmann, A., Paruthi, V., Krohm, F., Ganai, M.: Robust Boolean reasoning for equivalence checking and functional property verification. IEEE TCAD 21(12), 1377\u20131394 (2002)","journal-title":"IEEE TCAD"},{"issue":"9","key":"21_CR29","first-page":"1409","volume":"32","author":"J Lv","year":"2013","unstructured":"Lv, J., Kalla, P., Enescu, F.: Efficient Gr\u00f6bner basis reductions for formal verification of Galois field arithmetic circuits. IEEE TCAD 32(9), 1409\u20131420 (2013)","journal-title":"IEEE TCAD"},{"key":"21_CR30","doi-asserted-by":"crossref","unstructured":"Mahzoon, A., Gro\u00dfe, D., Drechsler, R.: PolyCleaner: clean your polynomials before backward rewriting to verify million-gate multipliers. In: ICCAD 2018, pp. 129:1\u2013129:8. ACM (2018)","DOI":"10.1145\/3240765.3240837"},{"key":"21_CR31","doi-asserted-by":"crossref","unstructured":"Mahzoon, A., Gro\u00dfe, D., Drechsler, R.: RevSCA: using reverse engineering to bring light into backward rewriting for big and dirty multipliers. In: DAC 2019, pp. 185:1\u2013185:6. ACM (2019)","DOI":"10.1145\/3316781.3317898"},{"key":"21_CR32","doi-asserted-by":"crossref","unstructured":"Mahzoon, A., Gro\u00dfe, D., Scholl, C., Drechsler, R.: Towards formal verification of optimized and industrial multipliers. In: DATE 2020, pp. 544\u2013549. IEEE (2020)","DOI":"10.23919\/DATE48585.2020.9116485"},{"key":"21_CR33","unstructured":"Meir, O., Nordstr\u00f6m, J., Robere, R., de Rezende, S.F.: Nullstellensatz size-degree trade-offs from reversible pebbling. ECCC 137, 18:1\u201318:16 (2019)"},{"key":"21_CR34","unstructured":"Miksa, M., Nordstr\u00f6m, J.: A generalized method for proving polynomial calculus degree lower bounds. In: Conference on Computational Complexity, CCC 2015. LIPIcs, vol. 33, pp. 467\u2013487. Schloss Dagstuhl (2015)"},{"key":"21_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/978-3-319-96145-3_32","volume-title":"Computer Aided Verification","author":"A Niemetz","year":"2018","unstructured":"Niemetz, A., Preiner, M., Wolf, C., Biere, A.: Btor2, BtorMC and Boolector\u00a03.0. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10981, pp. 587\u2013595. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96145-3_32"},{"key":"21_CR36","volume-title":"Computer Arithmetic - Algorithms and Hardware designs","author":"B Parhami","year":"2000","unstructured":"Parhami, B.: Computer Arithmetic - Algorithms and Hardware designs. Oxford University Press, New York (2000)"},{"key":"21_CR37","unstructured":"Ritirc, D., Biere, A., Kauers, M.: A practical polynomial calculus for arithmetic circuit verification. In: SC2 2018, pp. 61\u201376. CEUR-WS (2018)"},{"key":"21_CR38","doi-asserted-by":"crossref","unstructured":"Roche, D.S.: What can (and can\u2019t) we do with sparse polynomials? In: ISSAC, pp. 25\u201330. ACM (2018)","DOI":"10.1145\/3208976.3209027"},{"key":"21_CR39","doi-asserted-by":"crossref","unstructured":"Saraf, S., Volkovich, I.: Black-box identity testing of depth-4 multilinear circuits. Combinatorica 38(5), 1205\u20131238 (2018). https:\/\/doi.org\/10.1007\/s00493-016-3460-4","DOI":"10.1007\/s00493-016-3460-4"},{"key":"21_CR40","doi-asserted-by":"publisher","unstructured":"Soos, M., Meel, K.S.: BIRD: engineering an efficient CNF-XOR SAT solver and its applications to approximate model counting. In: AAAI 2019, pp. 1592\u20131599. AAAI Press (2019). https:\/\/doi.org\/10.1609\/aaai.v33i01.33011592","DOI":"10.1609\/aaai.v33i01.33011592"},{"key":"21_CR41","unstructured":"Wolfram Research Inc: Mathematica (2016), version 10.4"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60026-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T16:10:45Z","timestamp":1619280645000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60026-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030600259","9783030600266"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60026-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CASC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Computer Algebra in Scientific Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Linz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"casc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.casc-conference.org\/","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":"41","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":"34","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":"83% - 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.17","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":"5.6","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic. Two invited talks are also included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}