Lower bounds for runtime complexity of term rewriting (Q2398176)

From MaRDI portal
Revision as of 01:52, 28 February 2024 by SwMATHimport240215 (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
Lower bounds for runtime complexity of term rewriting
scientific article

    Statements

    title
    Lower bounds for runtime complexity of term rewriting (English)
    0 references
    author
    Florian Frohn
    0 references
    Jürgen Giesl
    0 references
    Jera Hensel
    0 references
    Cornelius Aschermann
    0 references
    Thomas Ströder
    0 references
    publication date
    15 August 2017
    0 references
    zbMATH Keywords
    complexity analysis
    0 references
    term rewriting
    0 references
    induction
    0 references
    lower bounds
    0 references
    describes a project that uses
    TcT
    0 references
    z3
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68T15
    0 references
    68Q17
    0 references
    68Q25
    0 references
    68Q42
    0 references
    zbMATH DE Number
    6760373
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2398176&oldid=22980727"
    Powered by MediaWiki