Refining complexity analyses in planning by exploiting the exponential time hypothesis (Q504223)

From MaRDI portal
Revision as of 08:46, 13 July 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
Refining complexity analyses in planning by exploiting the exponential time hypothesis
scientific article

    Statements

    Refining complexity analyses in planning by exploiting the exponential time hypothesis (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 January 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    action planning
    0 references
    computational complexity
    0 references
    lower bounds
    0 references
    upper bounds
    0 references
    exponential time hypothesis
    0 references
    0 references
    0 references