Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
No author records on this work.
The source holds an abstract for this work, but its best open-access copy is under no open licence, which does not permit us to republish the text. Read it at the source below.
this paper
works it cites
works citing it
node size = global citations · hover for the full title
What this paper cites, inside the corpus
What cites it, inside the corpus
Links
Topics
| Quantum Computing Algorithms and Architecture | Computer Science |
| Computability, Logic, AI Algorithms | Computer Science |
| Quantum Information and Cryptography | Computer Science |
Is this record sound?
partial
One field of this record is missing or disagrees with another. What is shown below is what the source publishes.
- weakensThe source lists no authors for this work at all, so there is nobody to attribute it to and it appears on no author page.
- supports45 reference(s) recorded.
- neutralThe DOI carries no year to check against.
- supportsA title is present.
Provenance
sha256 5cad55ac5d4d41e1…