Characterizing polynomial time complexity of stream programs using interpretations (Q2346991): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2015.03.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2036258793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4062633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138134 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new Characterization of Type-2 Feasibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850556 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On characterizations of the basic feasible functionals, Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ramified Corecurrence and Logspace / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feasible Functions over Co-inductive Data / 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: Q3142166 / 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: Higher-Order Interpretations and Program Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sup-interpretations, a semantic method for static analysis of program resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper Bounds on Stream I/O Using Semantic Interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpretation of Stream Programs: Characterizing Type 2 Polynomial Time Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesis of sup-interpretations: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Productivity of stream definitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms with polynomial interpretation termination proof / 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: Q4485693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4531985 / rank
 
Normal rank

Latest revision as of 02:48, 10 July 2024

scientific article
Language Label Description Also known as
English
Characterizing polynomial time complexity of stream programs using interpretations
scientific article

    Statements

    Characterizing polynomial time complexity of stream programs using interpretations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 May 2015
    0 references
    stream programs
    0 references
    type-2 functionals
    0 references
    interpretations
    0 references
    polynomial time
    0 references
    basic feasible functionals
    0 references
    computable analysis
    0 references
    rewriting
    0 references

    Identifiers