Testing shift-equivalence of polynomials by deterministic, probabilistic and quantum machines
- 1 June 1997
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 180 (1-2) , 217-228
- https://doi.org/10.1016/s0304-3975(96)00188-0
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- An approximation algorithm for the number of zeros or arbitrary polynomials over GF(q)Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On some approximation problems concerning sparse polynomials over finite fieldsTheoretical Computer Science, 1996
- Algorithms for computing sparse shifts for multivariate polynomialsPublished by Association for Computing Machinery (ACM) ,1995
- Quantum Cryptanalysis of Hidden Linear FunctionsPublished by Springer Nature ,1995
- On computing sparse shifts for univariate polynomialsPublished by Association for Computing Machinery (ACM) ,1994
- Quantum complexity theoryPublished by Association for Computing Machinery (ACM) ,1993
- A zero-test and an interpolation algorithm for the shifted sparse polynomialsPublished by Springer Nature ,1993
- Monte-Carlo approximation algorithms for enumeration problemsJournal of Algorithms, 1989
- Beth, Th., Verfahren der schnellen Fourier-Transformation. Stuttgart, B. G. Teubner 1984. 316 S., DM 34,—. ISBN 3-519-02363-6 (Leitfäden der angewandten Mathematik und Mechanik 61)ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1985
- Fast Probabilistic Algorithms for Verification of Polynomial IdentitiesJournal of the ACM, 1980