The computational complexity of propositional STRIPS planning (Q1337679)

From MaRDI portal
Revision as of 13:15, 31 January 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
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=13467050"
    Powered by MediaWiki