A large class of problems in symbolic computation can be expressed as the task of
computing some polynomials; and arithmetic circuits form the most standard model for …

We show that derandomizing Polynomial Identity Testing is, essentially, equivalent to
proving circuit lower bounds for NEXP. More precisely, we prove that if one can test in …

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

Effective Polynomial Computation is an introduction to the algorithms of computer algebra. It
discusses the basic algorithms for manipulating polynomials including factoring …

Algorithms are developed that adopt a novel implicit representation for multivariate
polynomials and rational functions with rational coefficients, that of black boxes for their …

In this work we study two, seemingly unrelated, notions. Locally Decodable Codes (LDCs)
are codes that allow the recovery of each message bit from a constant number of entries of …

A read-once formula is a Boolean formula in which each variable occurs, at most, once.
Such formulas are also called μ-formulas or Boolean trees. This paper treats the problem of …

Progress on Polynomial Identity Testing Page 1 Bulletin of the EATCS no 99, pp. 49 79,
October 2009 Oc European Association for Theoretical Computer Science T C …

We give a simple and new randomized primality testing algorithm by reducing primality
testing for number n to testing if a specific univariate identity over Zn holds. We also give …

This book is mainly devoted to some computational and algorithmic problems in finite fields
such as, for example, polynomial factorization, finding irreducible and primitive polynomials …