Abstract
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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Arvind, V., Das, B., & Mukhopadhyay, P. (2006). The complexity of black-box ring problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4112 LNCS, pp. 126–135). Springer Verlag. https://doi.org/10.1007/11809678_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
