A precise estimation of the computational complexity in Shor's factoring algorithm (Q5446367)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5244282
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A precise estimation of the computational complexity in Shor's factoring algorithm |
scientific article; zbMATH DE number 5244282 |
Statements
6 March 2008
0 references
Shor's factoring algorithm
0 references
computational complexity
0 references
0.7942155003547668
0 references
0.7156731486320496
0 references
0.705653190612793
0 references
