Formally verified certificate checkers for hardest-to-round computation (Q2352500)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Formally verified certificate checkers for hardest-to-round computation |
scientific article |
Statements
Formally verified certificate checkers for hardest-to-round computation (English)
0 references
2 July 2015
0 references
formal proofs
0 references
certificate checkers
0 references
Hensel's lemma
0 references
modular arithmetic
0 references
