On the Computational Complexity of Variants of Combinatorial Voter Control in Elections (Q2988834)

From MaRDI portal
Revision as of 20:09, 13 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
On the Computational Complexity of Variants of Combinatorial Voter Control in Elections
scientific article

    Statements

    title
    On the Computational Complexity of Variants of Combinatorial Voter Control in Elections (English)
    0 references
    author
    Leon Kellerhals
    0 references
    Viatcheslav Korenwein
    0 references
    Philipp Zschoche
    0 references
    Robert Bredereck
    0 references
    Jiehua Chen
    0 references
    publication date
    19 May 2017
    0 references
    cites work
    Q3077955
    0 references
    Q5710169
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q25
    0 references
    68Q17
    0 references
    91B12
    0 references
    zbMATH DE Number
    6721529
    0 references
    OpenAlex ID
    W2581940583
    0 references
    arXiv ID
    1701.05108
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2988834&oldid=36322939"
    Powered by MediaWiki