Formal and efficient primality proofs by use of computer algebra oracles (Q597112): Difference between revisions
From MaRDI portal
m rollbackEdits.php mass rollback Tag: Rollback |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1006/jsco.2001.0457 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2031410477 / rank | |||
Normal rank | |||
Latest revision as of 18:31, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Formal and efficient primality proofs by use of computer algebra oracles |
scientific article |
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
