Skip to search formSkip to main contentSkip to account menu

Polynomial identity testing

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

Related topics

Related topics

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
1 Randomized polynomial identity testing
Proof: We will prove this lemma by induction on n. This lemma can be proved simply by using conditional probability. Base Case… 
Review
2017
Review
2017
Lecture 5 – Polynomial Identity Testing
In this lecture we will cover a fundamental problem in complexity theory – polynomial identity testing (PIT). We will motivate… 
2015
2015
Blackbox Identity Testing for Simple Depth 3 Circuits
The Polynomial Identity Testing problem (PIT) requires one to determine whether a given polynomial is identically equal to the… 
2014
2014
Building Above Read-Once Polynomials: Identity Testing and Hardness of Representation
Polynomial Identity Testing (PIT) algorithms have focussed on polynomials computed either by small alternation-depth arithmetic… 
2014
2014
A brief history of polynomial identity testing
Polynomial identity testing is the problem of deciding if a given (multivariate) polynomial is identically zero. Over the past… 
2010
2010
Deterministic Black-Box Identity Testing pi-Ordered Algebraic Branching Programs
In this paper we study algebraic branching programs (ABPs) with restrictions on the order and the number of reads of variables in… 
2009
2009
Arithmetic Circuit Size, Identity Testing, and Finite Automata
Let Fhx1,x2,···,xni be the noncommutative polynomial ring over a field F, where the xi's are free noncommuting formal variables… 
2009
2009
Deterministic Identity Testing of Read-Once Algebraic Branching Programs
In this paper we study polynomial identity testing of sums of $k$ read-once algebraic branching programs ($\Sigma_k$-RO-ABPs… 
2009
2009
Polynomial Time with Restricted Use of Randomness
We define a hierarchy of complexity classes that lie between P and RP, yielding a new way of quantifying partial progress towards… 
Highly Cited
2005
Highly Cited
2005
On Minimizing Network Coding Resources : An Evolutionary Approach
We consider the problem of minimizing the amount of resources used for network coding while achieving the desired throughput in a… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)