The query complexity of order-finding (Q596296)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	The query complexity of order-finding	scientific article

Statements

scholarly article

0 references

The query complexity of order-finding (English)

0 references

0 references

Information and Computation

0 references

publication date

10 August 2004

0 references

full work available at URL

https://arxiv.org/abs/quant-ph/9911124

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

The Difference Between Consecutive Primes

0 references

Quantum Complexity Theory

0 references

Quantum algorithms revisited

0 references

0 references

Primes in short intervals

0 references

Zeros of L-functions

0 references

0 references

Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

0 references

On the Power of Quantum Computation

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

quant-ph/9911124

0 references

10.1016/J.IC.2004.04.001

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:596296

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q596296&oldid=38406737"