Formally verified certificate checkers for hardest-to-round computation (Q2352500)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6455036
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Formally verified certificate checkers for hardest-to-round computation |
scientific article; zbMATH DE number 6455036 |
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
0 references
0.7597076296806335
0 references
0.7541976571083069
0 references
0.744849681854248
0 references
0.7353611588478088
0 references
0.7330820560455322
0 references
