Probabilistic Recursion Theory and Implicit Computational Complexity (Q2938155)

From MaRDI portal
Revision as of 02:50, 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
Probabilistic Recursion Theory and Implicit Computational Complexity
scientific article

    Statements

    title
    Probabilistic Recursion Theory and Implicit Computational Complexity (English)
    0 references
    author
    Ugo Dal Lago
    0 references
    Sara Zuppiroli
    0 references
    publication date
    13 January 2015
    0 references
    Mathematics Subject Classification ID
    03D10
    0 references
    68Q10
    0 references
    03D15
    0 references
    68Q87
    0 references
    zbMATH DE Number
    6385966
    0 references
    OpenAlex ID
    W2160232022
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2938155&oldid=32870404"
    Powered by MediaWiki