Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs (Q3460055)

From MaRDI portal
Revision as of 02:22, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs
scientific article

    Statements

    Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs (English)
    0 references
    0 references
    0 references
    0 references
    12 January 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references