A Formalization of Polytime Functions (Q3088001): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q781248
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: David E. Nowak / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Coq / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-22863-6_11 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2952595174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Analysis by Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new function algebra of EXPTIME functions by safe nested recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Formal Language for Cryptographic Pseudocode / 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: A new recursion-theoretic characterization of the polytime functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New directions in cryptography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theorem Proving in Higher Order Logics / 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 Calculus for Game-Based Security Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3698786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational SLR: a logic for reasoning about computational indistinguishability / rank
 
Normal rank

Latest revision as of 10:17, 4 July 2024

scientific article
Language Label Description Also known as
English
A Formalization of Polytime Functions
scientific article

    Statements

    A Formalization of Polytime Functions (English)
    0 references
    0 references
    0 references
    17 August 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    implicit computational complexity
    0 references
    cryptography
    0 references
    0 references