Progress on Polynomial Identity Testing - II
From MaRDI portal
Publication:3656204
zbMath1188.68154arXiv1401.0976MaRDI QIDQ3656204
Publication date: 13 January 2010
Full work available at URL: https://arxiv.org/abs/1401.0976
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (32)
On division polynomial PIT and supersingularity ⋮ Exact learning from an honest teacher that answers membership queries ⋮ The Multivariate Schwartz--Zippel Lemma ⋮ An improved finiteness test and a systematic procedure to compute the strong \(\mathscr{H}_2\) norm of differential algebraic systems with multiple delays ⋮ Emptiness problems for integer circuits ⋮ Learning algebraic decompositions using Prony structures ⋮ Deterministic identity testing for sum of read-once oblivious arithmetic branching programs ⋮ Sampling Algebraic Varieties for Sum of Squares Programs ⋮ Testing the satisfiability of algebraic formulas over the field of two elements ⋮ Unnamed Item ⋮ Deterministic polynomial identity tests for multilinear bounded-read formulae ⋮ Hardness of graph-structured algebraic and symbolic problems ⋮ A case of depth-3 identity testing, sparse factorization and duality ⋮ Polynomial interpolation and identity testing from high powers over finite fields ⋮ Unnamed Item ⋮ Sylvester-Gallai type theorems for quadratic polynomials ⋮ Unnamed Item ⋮ A Wronskian approach to the real \(\tau\)-conjecture ⋮ Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing ⋮ Improved Explicit Hitting-Sets for ROABPs ⋮ Algebraic independence in positive characteristic: A $p$-adic calculus ⋮ A note on parameterized polynomial identity testing using hitting set generators ⋮ Unnamed Item ⋮ Blackbox identity testing for sum of special ROABPs and its border class ⋮ A promenade through correct test sequences. I: Degree of constructible sets, Bézout's inequality and density ⋮ Unnamed Item ⋮ A generalized sylvester-gallai type theorem for quadratic polynomials ⋮ Unnamed Item ⋮ Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees ⋮ Emptiness Problems for Integer Circuits ⋮ Improved hitting set for orbit of ROABPs ⋮ Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits
This page was built for publication: Progress on Polynomial Identity Testing - II
