Testing Equivalence of Polynomials under Shifts
From MaRDI portal
Publication:5167761
DOI10.1007/978-3-662-43948-7_35zbMath1412.68305arXiv1401.3714OpenAlexW2150559011MaRDI QIDQ5167761
Amir Shpilka, Rafael Mendes de Oliveira, Zeev Dvir
Publication date: 1 July 2014
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.3714
Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Randomized algorithms (68W20)
Related Items (4)
Unnamed Item ⋮ On the existence of telescopers for rational functions in three variables ⋮ Average-case linear matrix factorization and reconstruction of low width algebraic branching programs ⋮ Improved hitting set for orbit of ROABPs
This page was built for publication: Testing Equivalence of Polynomials under Shifts