Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines.

DOI10.1016/S0304-3975(96)00188-0zbMath1044.68946MaRDI QIDQ1390870

Dima Yu. Grigoriev

Publication date: 22 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computational aspects and applications of commutative rings (13P99) Foundations, quantum information and its processing, quantum axioms, and philosophy (81P99)

Related Items (7)

On the existence of telescopers for rational functions in three variables ⋮ On quantum algorithms for noncommutative hidden subgroups ⋮ An algorithm for deciding the summability of bivariate rational functions ⋮ Algebraic cryptography: new constructions and their security against provable break ⋮ Classical and quantum function reconstruction via character evaluation ⋮ Zero testing of \(p\)-adic and modular polynomials ⋮ On complexity of searching for periods of functions given by polynomials over a prime field

Cites Work

• On some approximation problems concerning sparse polynomials over finite fields
• Monte-Carlo approximation algorithms for enumeration problems
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Quantum computations: algorithms and error correction
• Quantum complexity theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines.