A hybrid multimodular polynomial reasoning method verifies arithmetic circuits without large-integer arithmetic by running computations in parallel modulo different primes.
http://www.eecs.berkeley.edu/~alanmi/abc/ (2019), bitbucket Version 1.01
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.SC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Avoiding Big Integers: Parallel Multimodular Algebraic Verification of Arithmetic Circuits
A hybrid multimodular polynomial reasoning method verifies arithmetic circuits without large-integer arithmetic by running computations in parallel modulo different primes.