A new order-theoretic characterisation of the polytime computable functions (Q2346988): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A new recursion-theoretic characterization of the polytime functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tyrolean Complexity Tool: Features and Usage. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guest editorial / 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 Path Order for Rewrite Systems that Compute Exponential Time Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysing the implicit complexity of programs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Analysis by Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Path Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms with polynomial interpretation termination proof / 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: Q4850553 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tiered small jump operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving Quadratic Derivational Complexities Using Context Dependent Interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortised Resource Analysis and Typed Polynomial Interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated Complexity Analysis Based on Context-Sensitive Rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combination Framework for Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: SPEED / rank
 
Normal rank
Property / cites work
 
Property / cites work: The realm of primitive recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263838 / 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: On Constructor Rewrite Systems and the Lambda-Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Analysis by Graph Rewriting / 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: Computability of Recursive Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix interpretations for proving termination of term rewriting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular Complexity Analysis via Relative Complexity / rank
 
Normal rank

Latest revision as of 03:48, 10 July 2024

scientific article
Language Label Description Also known as
English
A new order-theoretic characterisation of the polytime computable functions
scientific article

    Statements

    A new order-theoretic characterisation of the polytime computable functions (English)
    0 references
    0 references
    0 references
    0 references
    26 May 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    term rewriting
    0 references
    complexity analysis
    0 references
    implicit computational complexity
    0 references
    automation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references