The computational complexity of propositional STRIPS planning (Q1337679)

From MaRDI portal
Revision as of 00:51, 19 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The computational complexity of propositional STRIPS planning
scientific article

    Statements

    title
    The computational complexity of propositional STRIPS planning (English)
    0 references
    author
    Tom Bylander
    0 references
    publication date
    19 September 1995
    0 references
    zbMATH Keywords
    computational complexity
    0 references
    STRIPS planning
    0 references

    Identifiers

    zbMATH DE Number
    683692
    0 references
     
      Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1337679&oldid=1650312"
      Powered by MediaWiki