Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs (Q2331068): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q113901242, #quickstatements; #temporary_batch_1712286835472
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: (Leftmost-Outermost) Beta Reduction is Invariant, Indeed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit Computational Complexity of Subrecursive Definitions and Applications to Cryptographic Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Light types for polynomial time computation in lambda calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic relational verification for cryptographic implementations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Higher-Order Approximate Relational Refinement Types for Mechanism Design and Differential Privacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal certification of code-based cryptographic proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer-Aided Security Proofs for the Working Cryptographer / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometry of linear higher-order recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Dependent Types and Relative Completeness / rank
 
Normal rank
Property / cites work
 
Property / cites work: The geometry of types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lightweight semiformal time complexity analysis for purely functional data structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Expected Probabilistic Polynomial-Time Adversaries: A Suggestion for Restricted Definitions and Their Benefits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost recurrences for DML programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: SPEED / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized Resource Analysis with Polynomial Potential / rank
 
Normal rank
Property / cites work
 
Property / cites work: Safe recursion with higher types and BCK-algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A flow calculus of <i>mwp</i> -bounds for complexity analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3142166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure distributed programming with value-dependent types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependent types for program termination verification / rank
 
Normal rank

Latest revision as of 18:32, 20 July 2024

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
    25 October 2019
    0 references
    implicit computational complexity
    0 references
    complexity analysis
    0 references
    linear dependent types
    0 references
    cryptographic proofs
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references