The complexity of probabilistic lobbying (Q1662102)

From MaRDI portal
Revision as of 01:51, 5 April 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q59864911, #quickstatements; #temporary_batch_1712272666262)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of probabilistic lobbying
scientific article

    Statements

    title
    The complexity of probabilistic lobbying (English)
    0 references
    author
    Daniel Binkele-Raible
    0 references
    Gábor Erdélyi
    0 references
    Henning Fernau
    0 references
    Judy Goldsmith
    0 references
    Nicholas Mattei
    0 references
    Jörg Rothe
    0 references
    publication date
    17 August 2018
    0 references
    Mathematics Subject Classification ID
    91B12
    0 references
    68Q17
    0 references
    68Q25
    0 references
    91B14
    0 references
    zbMATH DE Number
    6920193
    0 references
    zbMATH Keywords
    computational complexity
    0 references
    parameterized complexity
    0 references
    approximability
    0 references
    computational social choice
    0 references
    describes a project that uses
    Paramils
    0 references
    SATzilla
    0 references
    OpenAlex ID
    W2569303878
    0 references
    Wikidata QID
    Q59864911
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1662102&oldid=33246732"
    Powered by MediaWiki