The computational complexity of rationalizing behavior (Q972378)

From MaRDI portal
Revision as of 20:17, 2 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
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 Keywords
    rationalization
    0 references
    computational complexity
    0 references
    NP-complete
    0 references
    arbitrary choice domains
    0 references

    Identifiers

    zbMATH DE Number
    5711897
    0 references
    OpenAlex ID
    W2148444551
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q972378&oldid=35171479"
    Powered by MediaWiki