# Primality and identity testing via Chinese remaindering

@article{Agrawal2003PrimalityAI, title={Primality and identity testing via Chinese remaindering}, author={Manindra Agrawal and S. Biswas}, journal={J. ACM}, year={2003}, volume={50}, pages={429-443} }

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 new randomized algorithms for testing if a multivariate polynomial, over a finite field or over rationals, is identically zero. The first of these algorithms also works over Zn for any n. The running time of the algorithms is polynomial in the size of arithmetic circuit representing the input polynomial and the error… Expand

#### 39 Citations

Simple construction of biased distribution

- Mathematics
- 2011

biased distribution has many applications in practice, including universal hashing computation. In this paper we will improve an existing -biased distribution construction due to Alon et al. [2] that… Expand

On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors

- Computer Science, Mathematics
- ICALP
- 2010

It is shown that for any reasonable circuit class there is a deterministic polynomial time (black-box) algorithm forPolynomial identity testing of that class if and only if there is an algorithm for factoring a polynomials, computed in the class, to its indecomposable components. Expand

Algorithms for Arithmetic Circuits

- Computer Science, Mathematics
- Electron. Colloquium Comput. Complex.
- 2010

The algorithmic complexity of these problems is studied and a deterministic algorithm and randomized polynomial-time algorithms are presented for certain special cases of the third problem. Expand

Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic Circuits

- Mathematics, Computer Science
- SIAM J. Comput.
- 2009

If the methods of Kabanets and Impagliazzo can be used to show that derandomizing identity testing for bounded depth circuits implies lower bounds for the same class of circuits, then NEXP does not have bounded depth arithmetic circuits. Expand

From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 Circuits

- Mathematics, Computer Science
- FOCS
- 2010

The structure theorem essentially says that the number of independent variables in a real depth-3 identity is very small and affirmatively settles the strong rank conjecture posed by Dvir & Shpilka (STOC 2005). Expand

Quantum Query Complexity of Multilinear Identity Testing

- Computer Science, Mathematics
- Electron. Colloquium Comput. Complex.
- 2008

This work studies the problem of testing if the polynomial of a black-box finite ring is an \emph{identity} for the given ring and gives a quantum algorithm with query complexity sub-linear in the number of generators for the ring, when theNumber of indeterminates of the input polynometric is small. Expand

New Results on Noncommutative and Commutative Polynomial Identity Testing

- Mathematics, Computer Science
- Computational Complexity Conference
- 2008

The complexity of the problem when the coefficients of the input polynomial come from an arbitrary finite commutative ring with unity whose elements are uniformly encoded as strings and the ring operations are given by an oracle is explored. Expand

Evaluating Matrix Circuits

- Mathematics, Computer Science
- COCOON
- 2015

It is shown that the compressed word problem for every finitely generated nilpotent group is in $\ mathsf{DET} \subseteq \mathsf{NC}^2$. Expand

On testing monomials in multivariate polynomials

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 2013

This paper presents a summary of initial work on developing a theory of testing monomials in multivariate polynomials, to ask whether a polynomial represented by certain economically compact structure has a multilinear monomial in its sum-product expansion. Expand

Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials

- Mathematics, Computer Science
- J. Comb. Optim.
- 2013

This paper proves that the first problem is #P-hard and devise a O∗(3ns(n))) upper bound for this problem for any polynomial represented by an arithmetic circuit of size s(n), and designs fully polynomials-time randomized approximation schemes for the second problem, how to compute the coefficients of multilinear monomials. Expand

#### References

SHOWING 1-10 OF 39 REFERENCES

Checking polynomial identities over any field: towards a derandomization?

- Computer Science, Mathematics
- STOC '98
- 1998

A Monte Carlo algorithm for testing multivariate polynomial identities over any field using fewer random bits than other methods and proving a lower bound showing that the number of random bits used by the algorithm is essentially optimal in the black-box model. Expand

Reducing randomness via irrational numbers

- Computer Science
- STOC '97
- 1997

A general methodology for testing whether a given polynomial with integer coefficients is identically zero is proposed, which can decrease the error probability by increasing the precision of the approximations instead of using more random bits. Expand

Riemann's Hypothesis and tests for primality

- Computer Science, Mathematics
- STOC
- 1975

It is shown that primality is testable in time a polynomial in the length of the binary representation of a number, and a partial solution is given to the relationship between the complexity of computing the prime factorization of a numbers, computing the Euler phi function, and computing other related functions. Expand

On Zero-Testing and Interpolation of k-Sparse Multivariate Polynomials Over Finite Fields

- Computer Science, Mathematics
- Theor. Comput. Sci.
- 1991

The result is that the time complexity of such strategies depends critically on the degree m of the extension field of K from which the arguments are to be chosen; e.g. if m equals the number n of variables, then (1) can be solved by k +1 and (2) as well as (3) by 2 k + 1 queries, while in case m = 1 essentially 2 log n ·log k queries are needed. Expand

Randomness-Optimal Unique Element Isolation with Applications to Perfect Matching and Related Problems

- Mathematics, Computer Science
- SIAM J. Comput.
- 1995

The randomness complexity of the unique element isolation problem is precisely characterized and a randomness-efficient random reduction from $SAT to $USAT$ is obtained, the language of uniquely satisfiable formulas which can be derandomized in the case of languages in FewP to yield new proofs of the results. Expand

Probabilistic algorithm for testing primality

- Mathematics
- 1980

Abstract We present a practical probabilistic algorithm for testing large numbers of arbitrary form for primality. The algorithm has the feature that when it determines a number composite then the… Expand

Randomness-optimal unique element isolation, with applications to perfect matching and related problems

- Mathematics, Computer Science
- STOC '93
- 1993

The technique also gives randomness-efficient solutions for several problems in which the unique element isolation tool is used, such as $RNC algorithms for variants of matching and basic problems on linear matroids such as matroid intersection and matroid matching. Expand

Proof verification and hardness of approximation problems

- Computer Science, Mathematics
- Proceedings., 33rd Annual Symposium on Foundations of Computer Science
- 1992

The authors improve on their result by showing that NP=PCP(logn, 1), which has the following consequences: (1) MAXSNP-hard problems do not have polynomial time approximation schemes unless P=NP; and (2) for some epsilon >0 the size of the maximal clique in a graph cannot be approximated within a factor of n/sup ePSilon / unless P =NP. Expand

Non-deterministic exponential time has two-prover interactive protocols

- Computer Science
- computational complexity
- 2005

It is shown that the class of languages having tow-prover interactive proof systems is nondeterministic exponential time and that to prove membership in languages inEXP, the honest provers need the power ofEXP only. Expand

Interpolation and Approximation of Sparse Multivariate Polynomials over GF(2)

- Mathematics, Computer Science
- SIAM J. Comput.
- 1991

It is shown that evaluation points are sufficient for the (deterministic) $\varepsilon $-approximation of any t-sparse function, and that an order $(t / \varpsilon )^{\alpha (t,\varePSilon )} \cdot \log n$ points are necessary for this purpose. Expand