A case study of number-theoretic computation: Searching for primes in arithmetic progression (Q1055463)
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: A case study of number-theoretic computation: Searching for primes in arithmetic progression |
scientific article; zbMATH DE number 3823884
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A case study of number-theoretic computation: Searching for primes in arithmetic progression |
scientific article; zbMATH DE number 3823884 |
Statements
A case study of number-theoretic computation: Searching for primes in arithmetic progression (English)
0 references
1983
0 references
primes in arithmetic progression
0 references
design of algorithms
0 references
asymptotic complexity
0 references
