On sharing, memoization, and polynomial time (Q1640979): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ic.2018.05.003 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Q4850553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2954984 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4436033 / 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: Recursion Schemata for NC k / 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: Term rewriting theory for the primitive recursive functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Essentials of Term Graph Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysing the implicit complexity of programs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-interpretations. A way to control resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Complexity Analysis Based on the Dependency Pair Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivational Complexity Is an Invariant Cost Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5111892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Constructor Rewrite Systems and the Lambda Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beta reduction is invariant, indeed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closing the Gap Between Runtime Complexity and Polytime Computability. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On quasi-interpretations, blind abstractions and implicit complexity / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IC.2018.05.003 / rank
 
Normal rank

Latest revision as of 00:23, 11 December 2024

scientific article
Language Label Description Also known as
English
On sharing, memoization, and polynomial time
scientific article

    Statements

    On sharing, memoization, and polynomial time (English)
    0 references
    0 references
    0 references
    14 June 2018
    0 references
    implicit computational complexity
    0 references
    data-tiering
    0 references
    polynomial time
    0 references

    Identifiers