A combination framework for complexity (Q276251): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ic.2015.12.007 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ic.2015.12.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W148448369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotonicity Constraints for Termination in the Integer Domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms with polynomial interpretation termination proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination proofs and the length of derivations / 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: Closing the Gap Between Runtime Complexity and Polytime Computability. / 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: A new order-theoretic characterisation of the polytime computable functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial Path Orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: POP* and Semantic Labeling Using SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular Complexity Analysis via Relative Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity, Graphs, and the Dependency Pair Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tyrolean Complexity Tool: Features and Usage. / 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: Quasi-interpretation Synthesis by Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combination Framework for Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity analysis of term-rewriting systems / 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: Multivariate amortized resource analysis / 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: Automatic Type Inference for Amortised Heap-Space Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing innermost runtime complexity of term rewriting by dependency pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular termination proofs for rewriting using dependency pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Termination of term rewriting using dependency pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Derivational Complexity Induced by the Dependency Pair Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rewriting Techniques and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size-change principle for program termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncurrying for termination and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Joint Spectral Radius Theory for Automated Complexity Analysis of Rewrite Systems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IC.2015.12.007 / rank
 
Normal rank

Latest revision as of 13:09, 9 December 2024

scientific article
Language Label Description Also known as
English
A combination framework for complexity
scientific article

    Statements

    A combination framework for complexity (English)
    0 references
    0 references
    0 references
    3 May 2016
    0 references
    term rewriting
    0 references
    resource analysis
    0 references
    runtime complexity
    0 references
    automation
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references