Avoiding big integers: parallel multimodular algebraic verification of arithmetic circuits

DOI10.1007/978-3-032-32589-1_11MaRDI QIDQ7411163zbMATH OpenFDO

Authors Clemens Hofstadler, Daniela Kaufmann, Chen Chen

Publication date 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-032-32589-1_11

zbMATH Keywords

computer algebraguess and provehardware verificationhomomorphic imageslinear extractions

Mathematics Subject Classification ID

Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites work

• \textsf{f4ncgb}: high performance Gröbner basis computations in free algebras
• An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
• Incremental column-wise verification of arithmetic circuits using computer algebra
• Modern computer algebra
• Modular algorithms for computing Gröbner bases in free algebras
• Modular algorithms for computing Gröbner bases.
• Modular forms, a computational approach. With an appendix by Paul E. Gunnells
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• PBLib -- a library for encoding pseudo-Boolean constraints into CNF
• Practical algebraic calculus and Nullstellensatz with the checkers Pacheck and Pastèque and Nuss-Checker
• Short proofs of ideal membership
• The complexity of the word problems for commutative semigroups and polynomial ideals
• Using Algebraic Geometry

This page was built for publication: Avoiding big integers: parallel multimodular algebraic verification of arithmetic circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7411163)