An algorithm for realizing finite field arithmetic is presented. The relationship between linear recursions and polynomial arithmetic (modulo a fixed polynomial) over $Zp$ is exploited to reduce the ...

Quadratic equations are polynomials, meaning strings of math terms. An expression like “x + 4” is a polynomial. They can have ...

Presburger arithmetic is the first-order theory of the natural numbers with addition (but no multiplication). We characterize sets that can be defined by a Presburger formula as exactly the sets whose ...

Polynomial Identity Testing (PIT) is a central problem in this arena, involving the efficient determination of whether a given arithmetic circuit computes the zero polynomial.