A general heuristic bottom-up procedure for searching AND/OR graphs (Q2639647)

From MaRDI portal
Revision as of 11:22, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A general heuristic bottom-up procedure for searching AND/OR graphs
scientific article

    Statements

    title
    A general heuristic bottom-up procedure for searching AND/OR graphs (English)
    0 references
    author
    Vipin Kumar
    0 references
    publication date
    1991
    0 references
    Mathematics Subject Classification ID
    68R10
    0 references
    68T20
    0 references
    90C39
    0 references
    90C35
    0 references
    zbMATH DE Number
    4185050
    0 references
    zbMATH Keywords
    heuristic bottom-up procedure
    0 references
    AND/OR graph
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2639647&oldid=15439770"
    Powered by MediaWiki