Polynomial time solutions of some problems of computational algebra
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Structural complexity 1
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Structural complexity 2
Local expansion of vertex-transitive graphs and random generation in finite groups
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Bounded round interactive proofs in finite groups
SIAM Journal on Discrete Mathematics
SIAM Journal on Computing
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Deciding properties of polynomials without factoring
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Computations for algebras and group representations
Computations for algebras and group representations
Modern Computer Algebra
On the Ring Isomorphism and Automorphism Problems
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
On The Complexity Of Matrix Group Problems I
SFCS '84 Proceedings of the 25th Annual Symposium onFoundations of Computer Science, 1984
Automorphisms of finite rings and applications to complexity of problems
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
We study the complexity of some computational problems on finite black-box rings whose elements are encoded as strings of a given length and the ring operations are performed by a black-box oracle. We give a polynomial-time quantum algorithm to compute a basis representation for a given black-box ring. Using this result we obtain polynomial-time quantum algorithms for several natural computational problems over black-box rings.