𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Deterministically testing sparse polynomial identities of unbounded degree

✍ Scribed by Markus Bläser; Moritz Hardt; Richard J. Lipton; Nisheeth K. Vishnoi

Book ID
108154596
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
171 KB
Volume
109
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Testing shift-equivalence of polynomials
Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines
✍ D. Grigoriev 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 930 KB

The polynomials f, g E F[Xl, ,X,J are called shift-equivalent if there exists a shift (a~, , cc,) E F" such that f(Xl furl, . . ,X,, + CC,) = g. In three different cases algorithms which produce the set of all shift-equivalences of f, g in polynomial time are designed. Here (1) in the case of a zero