Testing the shift-equivalence of polynomials using quantum machines

DOI10.1007/BF02362466zbMath0999.12017MaRDI QIDQ1356318

Dima Yu. Grigoriev

Publication date: 27 November 2001

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

zbMATH Keywords

polynomial time algorithmsquantum machineshift equivalences

Mathematics Subject Classification ID

Related Items (1)

On complexity of searching for periods of functions given by polynomials over a prime field

Cites Work

• Monte-Carlo approximation algorithms for enumeration problems
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Quantum complexity theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Testing the shift-equivalence of polynomials using quantum machines