Reducing the time complexity of testing for local threshold testability (Q703505)

From MaRDI portal
Revision as of 17:09, 7 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Reducing the time complexity of testing for local threshold testability
scientific article

    Statements

    title
    Reducing the time complexity of testing for local threshold testability (English)
    0 references
    author
    A. N. Trahtman
    0 references
    publication date
    11 January 2005
    0 references
    zbMATH DE Number
    2126089
    0 references
    zbMATH Keywords
    Automaton
    0 references
    Threshold locally testable
    0 references
    Graph
    0 references
    Algorithm
    0 references
    describes a project that uses
    LANGAGEA
    0 references
    LANGAGE
    0 references
    TESTAS
    0 references
    OpenAlex ID
    W3104869282
    0 references
    arXiv ID
    2011.06262
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q703505&oldid=34377503"
    Powered by MediaWiki