Progress on Polynomial Identity Testing-II
From MaRDI portal
Publication:2821698
DOI10.1007/978-3-319-05446-9_7zbMath1345.68182OpenAlexW2963534336MaRDI QIDQ2821698
Publication date: 22 September 2016
Published in: Perspectives in Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-05446-9_7
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (18)
Algebraic independence over positive characteristic: new criterion and applications to locally low-algebraic-rank circuits ⋮ Learning algebraic decompositions using Prony structures ⋮ Deterministic identity testing for sum of read-once oblivious arithmetic branching programs ⋮ Testing the satisfiability of algebraic formulas over the field of two elements ⋮ Unnamed Item ⋮ Hardness of graph-structured algebraic and symbolic problems ⋮ Unnamed Item ⋮ Subspace Arrangements, Graph Rigidity and Derandomization Through Submodular Optimization ⋮ Improved Explicit Hitting-Sets for ROABPs ⋮ Unnamed Item ⋮ Building above read-once polynomials: identity testing and hardness of representation ⋮ 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 ⋮ A generalized sylvester-gallai type theorem for quadratic polynomials ⋮ Unnamed Item ⋮ Emptiness Problems for Integer Circuits ⋮ Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits ⋮ Compression techniques in group theory
This page was built for publication: Progress on Polynomial Identity Testing-II
