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
68Q25: Analysis of algorithms and problem complexity
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Unnamed Item, Sampling Algebraic Varieties for Sum of Squares Programs, Algorithms Based on *-Algebras, and Their Applications to Isomorphism of Polynomials with One Secret, Group Isomorphism, and Polynomial Identity Testing, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, The Multivariate Schwartz--Zippel Lemma, Sylvester-Gallai type theorems for quadratic polynomials, A generalized sylvester-gallai type theorem for quadratic polynomials, Emptiness Problems for Integer Circuits, Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits, Algebraic independence in positive characteristic: A $p$-adic calculus, Unnamed Item, Testing the satisfiability of algebraic formulas over the field of two elements, Hardness of graph-structured algebraic and symbolic problems, Improved Explicit Hitting-Sets for ROABPs, A Wronskian approach to the real \(\tau\)-conjecture, Deterministic polynomial identity tests for multilinear bounded-read formulae, On division polynomial PIT and supersingularity, Deterministic identity testing for sum of read-once oblivious arithmetic branching programs, Polynomial interpolation and identity testing from high powers over finite fields, A case of depth-3 identity testing, sparse factorization and duality, 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, Improved hitting set for orbit of ROABPs, 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, A note on parameterized polynomial identity testing using hitting set generators, Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees, Exact learning from an honest teacher that answers membership queries
