ON COMPUTATIONAL COMPLEXITY OF QUANTUM ALGORITHM FOR FACTORING (Q3449656)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: ON COMPUTATIONAL COMPLEXITY OF QUANTUM ALGORITHM FOR FACTORING |
scientific article; zbMATH DE number 6504780
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | ON COMPUTATIONAL COMPLEXITY OF QUANTUM ALGORITHM FOR FACTORING |
scientific article; zbMATH DE number 6504780 |
Statements
ON COMPUTATIONAL COMPLEXITY OF QUANTUM ALGORITHM FOR FACTORING (English)
0 references
4 November 2015
0 references
quantum algorithm
0 references
prime factoring
0 references
computational complexity
0 references
0.9129685
0 references
0.9103322
0 references
0.9103322
0 references
0.90095705
0 references
0.89647216
0 references
0.8956157
0 references
0.8934798
0 references
