Formal and efficient primality proofs by use of computer algebra oracles (Q597112)
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: Formal and efficient primality proofs by use of computer algebra oracles |
scientific article; zbMATH DE number 2082486
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Formal and efficient primality proofs by use of computer algebra oracles |
scientific article; zbMATH DE number 2082486 |
Statements
Formal and efficient primality proofs by use of computer algebra oracles (English)
0 references
6 August 2004
0 references
Pocklington criterion
0 references
primality of large positive numbers
0 references
computer algebra
0 references
0 references
0.8663296
0 references
0.8644492
0 references
0.8615461
0 references
0.8614521
0 references
0.86080116
0 references
