Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer

Reference note

Why this source is in the ledger

Peter W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM Journal on Computing 26 (1997), 1484–1509, DOI: 10.1137/S0097539795293172.

Catalog connections

Conjectures citing this source

• TCS-012Deterministic Polynomial-Time Integer FactoringTheoretical computer science
• TCS-023$BQP$ versus $BPP$Theoretical computer science

Source record

Bibliographic fields