Polynomial identity testing

In mathematics, polynomial identity testing (PIT) is the problem of efficiently determining whether two multivariate polynomials are identical. More… (More)
Wikipedia

Related topics

Related topics

14 relations
AKS primality testBPP (complexity)Computational complexity theoryDegree of a polynomial
(More)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Equivalence of Polynomial Identity Testing and Polynomial Factorization
In this paper, we show that the problem of deterministically factoring multivariate polynomials reduces to the problem of… (More)
Is this relevant?
2014
2014
Circuit Complexity, Proof Complexity, and Polynomial Identity Testing
We introduce a new and natural algebraic proof system, which has tight connections to (algebraic) circuit complexity. In… (More)
Is this relevant?
2014
2014
Equivalence of Polynomial Identity Testing and Deterministic Multivariate Polynomial Factorization
In this paper we show that the problem of deterministically factoring multivariate polynomials reduces to the problem of… (More)
Is this relevant?
Review
2013
Review
2013
Progress on Polynomial Identity Testing - II
  • Nitin Saxena
  • Electronic Colloquium on Computational Complexity
  • 2013
We survey the area of algebraic complexity theory; with the focus being on the problem of polynomial identity testing (PIT). We… (More)
  • figure 1
Is this relevant?
2009
2009
Improved Polynomial Identity Testing for Read-Once Formulas
An arithmetic read-once formula (ROF for short) is a formula (a circuit whose underlying graph is a tree) in which the operations… (More)
Is this relevant?
2009
2009
Blackbox Polynomial Identity Testing for Depth 3 Circuits
We study depth three arithmetic circuits with bounded top fanin. We give the first deterministic polynomial time blackbox… (More)
Is this relevant?
2008
2008
Read-once polynomial identity testing
In this paper we study the problems of polynomial identity testing (PIT) and reconstruction of read-once formulas. The following… (More)
Is this relevant?
2008
2008
New Results on Noncommutative and Commutative Polynomial Identity Testing
Using ideas from automata theory, we design the first polynomial deterministic identity testing algorithm for the sparse… (More)
Is this relevant?
2005
2005
More on noncommutative polynomial identity testing
We continue the study of noncommutative polynomial identity testing initiated by Raz and Shpilka and present efficient algorithms… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Deterministic polynomial identity testing in non-commutative models
We give a deterministic polynomial time algorithm for polynomial identity testing in the following two cases: 1. Non-commutative… (More)
Is this relevant?