Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,608,946 papers from all fields of science
Search
Sign In
Create Free Account
Polynomial identity testing
In mathematics, polynomial identity testing (PIT) is the problem of efficiently determining whether two multivariate polynomials are identical. More…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
14 relations
AKS primality test
BPP (complexity)
Computational complexity theory
Degree of a polynomial
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
1 Randomized polynomial identity testing
Madhur Tulsiani
2018
Corpus ID: 54180864
Proof: We will prove this lemma by induction on n. This lemma can be proved simply by using conditional probability. Base Case…
Expand
2018
2018
Some complexity classes , Polynomial Identity Testing & Tail bounds
Eyal Golombek
2018
Corpus ID: 53608132
• R Time/Space: One-sided error. For every input not in the language, the acceptance probability is zero, for every input in the…
Expand
2018
2018
Beating Brute Force for Polynomial Identity Testing of General Depth-3 Circuits
V. Arvind
,
Abhranil Chatterjee
,
Rajit Datta
,
P. Mukhopadhyay
Electron. Colloquium Comput. Complex.
2018
Corpus ID: 49340080
Let C be a depth-3 ΣΠΣ arithmetic circuit of size s, computing a polynomial f ∈ F[x1, . . . , xn] (where F = Q or C) with fan-in…
Expand
Review
2017
Review
2017
Lecture 5 – Polynomial Identity Testing
Michael P. Kim
2017
Corpus ID: 92981000
In this lecture we will cover a fundamental problem in complexity theory – polynomial identity testing (PIT). We will motivate…
Expand
2016
2016
A Polynomial Time Deterministic Algorithm for Identity Testing
Ilya Volkovich
2016
Corpus ID: 45329415
The polynomial identity testing problem, or PIT, asks how we can decide if a polynomial is equivalent to zero. A read-once…
Expand
2015
2015
Blackbox Identity Testing for Simple Depth 3 Circuits
Dr. Nitin Kishore Saxena
2015
Corpus ID: 18440031
The Polynomial Identity Testing problem (PIT) requires one to determine whether a given polynomial is identically equal to the…
Expand
2009
2009
Arithmetic Circuit Size, Identity Testing, and Finite Automata
V. Arvind
,
Pushkar S. Joglekar
Electron. Colloquium Comput. Complex.
2009
Corpus ID: 12356292
Let Fhx1,x2,···,xni be the noncommutative polynomial ring over a field F, where the xi's are free noncommuting formal variables…
Expand
2009
2009
Polynomial Time with Restricted Use of Randomness
Matei David
,
Periklis A. Papakonstantinou
,
Anastasios Sidiropoulos
Electron. Colloquium Comput. Complex.
2009
Corpus ID: 12758916
We define a hierarchy of complexity classes that lie between P and RP, yielding a new way of quantifying partial progress towards…
Expand
2009
2009
Arithmetic Circuits and Identity Testing
Ramprasad Saptharishi
,
Piyush P. Kurur
,
Somenath Biswas
,
Sumit Ganguly
2009
Corpus ID: 16557427
We study the problem of polynomial identity testing (PIT) in arithmetic circuits. is is a fundamental problem in computational…
Expand
2008
2008
A Note on Irreducible Polynomials and Identity Testing
Chandan Saha
2008
Corpus ID: 16607773
We show that, given a finite field Fq and an integer d > 0, there is a deterministic algorithm that finds an irreducible…
Expand