Complexity and algorithms for reasoning about time (Q4285633)

From MaRDI portal
Revision as of 18:21, 19 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 529933
Language Label Description Also known as
English
Complexity and algorithms for reasoning about time
scientific article; zbMATH DE number 529933

    Statements

    title
    Complexity and algorithms for reasoning about time (English)
    0 references
    author
    Ron Shamir
    0 references
    publication date
    11 September 1994
    0 references
    zbMATH Keywords
    complexity
    0 references
    DNA mapping
    0 references
    temporal reasoning
    0 references
    interval algebras
    0 references
    interval orders
    0 references
    interval graphs
    0 references
    satisfiability
    0 references
    sandwich problem
    0 references
    NP-complete
    0 references

    Identifiers

    DOI
    10.1145/174147.169675
    0 references
    Mathematics Subject Classification ID
    68Q25
    0 references
    68T15
    0 references
    68R10
    0 references
    92D20
    0 references
    zbMATH DE Number
    529933
    0 references
    Wikidata QID
    Q56267430
    0 references
    OpenAlex ID
    W1972734518
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4285633&oldid=31302817"
    Powered by MediaWiki