The computational complexity of rationalizing behavior (Q972378)

From MaRDI portal
Revision as of 02:09, 21 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q836930)
scientific article
Language Label Description Also known as
English
The computational complexity of rationalizing behavior
scientific article

    Statements

    title
    The computational complexity of rationalizing behavior (English)
    0 references
    author
    Jose Apesteguia
    0 references
    publication date
    25 May 2010
    0 references
    zbMATH DE Number
    5711897
    0 references
    zbMATH Keywords
    rationalization
    0 references
    computational complexity
    0 references
    NP-complete
    0 references
    arbitrary choice domains
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q972378&oldid=22061722"
    Powered by MediaWiki