On the distribution of running times of certain integer factoring algorithms (Q3031925)
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: Publication:3031925 |
scientific article; zbMATH DE number 4130007
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the distribution of running times of certain integer factoring algorithms |
scientific article; zbMATH DE number 4130007 |
Statements
On the distribution of running times of certain integer factoring algorithms (English)
0 references
1989
0 references
integer factorization problem
0 references
lower bound
0 references
random polynomial time
0 references
0.801990270614624
0 references
0.8002577424049377
0 references
0.7949604988098145
0 references
0.7730221748352051
0 references
