Arithmetic circuit complexity investigates the computational resources required to evaluate polynomial functions via networks of arithmetic operations. At its core, this field seeks to classify ...

Inspired by Rearick's work on logarithm and exponential functions of arithmetic functions, we introduce two new operators, LOG and EXP. The LOG operates on generalized Fibonacci polynomials giving ...

An algorithm for realizing finite field arithmetic is presented. The relationship between linear recursions and polynomial arithmetic (modulo a fixed polynomial) over ...

Both algebraic and arithmetic geometry are concerned with the study of solution sets of systems of polynomial equations. Algebraic geometry deals primarily with solutions lying in an algebraically ...