(Q55869064)

English

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

scientific article published in 1997

In more languages

default for all languages

No label defined

No description defined

edit

Statements

instance of

scholarly article

0 references

title

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

0 references

0 references

0 references

Peter W. Shor

1

0 references

language of work or name

English

0 references

publication date

October 1997

0 references

published in

SIAM Journal on Computing

0 references

volume

26

0 references

issue

5

0 references

page(s)

1484-1509

0 references

maintained by WikiProject

WikiProject Mathematics

0 references

cites work

On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction

1 reference

stated in

COCI

reference URL

https://opencitations.net/index/coci/api/v1/citations/10.1112/PLMS/S2-43.6.544

retrieved

13 November 2021

Discrete Logarithms in GF(P) Using the Number Field Sieve

1 reference

20 June 2022

https://opencitations.net/index/coci/api/v1/citations/10.1137/0406010

Identifiers

DOI

10.1137/S0097539795293172

0 references

arXiv ID

quant-ph/9508027

0 references

DBLP publication ID

journals/siamcomp/Shor97

1 reference

stated in

DBLP Dataset 2021-01-02

retrieved

28 January 2021

Internet Archive ID

arxiv-quant-ph9508027

1 reference

reference URL

https://archive.org/metadata/arxiv-quant-ph9508027

zbMATH Open document ID

1005.11065

0 references

(Q55869064)

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

Statements

Identifiers

Sitelinks

Wikipedia(0 entries)

Wikibooks(0 entries)

Wikinews(0 entries)

Wikiquote(0 entries)

Wikisource(0 entries)

Wikiversity(0 entries)

Wikivoyage(0 entries)

Wiktionary(0 entries)

Multilingual sites(0 entries)