# Polynomial identity testing

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- computational complexity
- 2015

In this paper, we show that the problem of deterministically factoring multivariate polynomials reduces to the problem ofâ€¦Â (More)

Is this relevant?

2014

2014

- IEEE 55th Annual Symposium on Foundations ofâ€¦
- 2014

We introduce a new and natural algebraic proof system, which has tight connections to (algebraic) circuit complexity. Inâ€¦Â (More)

Is this relevant?

2014

2014

- IEEE 29th Conference on Computational Complexityâ€¦
- 2014

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

- 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)

Is this relevant?

2009

2009

- APPROX-RANDOM
- 2009

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

- 50th Annual IEEE Symposium on Foundations ofâ€¦
- 2009

We study depth three arithmetic circuits with bounded top fanin. We give the first deterministic polynomial time blackboxâ€¦Â (More)

Is this relevant?

2008

2008

- STOC
- 2008

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

- computational complexity
- 2008

Using ideas from automata theory, we design the first polynomial deterministic identity testing algorithm for the sparseâ€¦Â (More)

Is this relevant?

2005

2005

- 20th Annual IEEE Conference on Computationalâ€¦
- 2005

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

- computational complexity
- 2004

We give a deterministic polynomial time algorithm for polynomial identity testing in the following two cases: 1. Non-commutativeâ€¦Â (More)

Is this relevant?