A Case Study of Number-Theoretic Computation: Searching for Primes in Arithmetic Progression
| dc.contributor.author | Pritchard, Paul | en_US |
| dc.date.accessioned | 2007-04-23T16:44:39Z | |
| dc.date.available | 2007-04-23T16:44:39Z | |
| dc.date.issued | 1982-07 | en_US |
| dc.description.abstract | NO ABSTRACT SUPPLIED | en_US |
| dc.format.extent | 1489178 bytes | |
| dc.format.extent | 330777 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR82-504 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6344 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | A Case Study of Number-Theoretic Computation: Searching for Primes in Arithmetic Progression | en_US |
| dc.type | technical report | en_US |