Formally verified certificate checkers for hardest-to-round computation (Q2352500)

From MaRDI portal
Revision as of 10:51, 10 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Formally verified certificate checkers for hardest-to-round computation
scientific article

    Statements

    title
    Formally verified certificate checkers for hardest-to-round computation (English)
    0 references
    author
    Érik Martin-Dorel
    0 references
    Micaela Mayero
    0 references
    Laurent Théry
    0 references
    Guillaume Hanrot
    0 references
    publication date
    2 July 2015
    0 references
    zbMATH Keywords
    formal proofs
    0 references
    certificate checkers
    0 references
    Hensel's lemma
    0 references
    modular arithmetic
    0 references
    describes a project that uses
    Autoref
    0 references
    Coq
    0 references
    Coq/SSReflect
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68T15
    0 references
    65G99
    0 references
    68Q60
    0 references
    68W30
    0 references
    zbMATH DE Number
    6455036
    0 references
    OpenAlex ID
    W2043168300
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2352500&oldid=36189500"
    Powered by MediaWiki