The complexity of Kemeny elections (Q817813): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2783476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Voting schemes for which it can be difficult to tell who won the election / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong exponential hierarchy collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact analysis of Dodgson elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparison of polynomial time reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4743737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact complexity of the winner problem for Young elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472458 / rank
 
Normal rank
Property / cites work
 
Property / cites work: More complicated questions about maxima and minima, and some closures of NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Query Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Consistent Extension of Condorcet’s Election Principle / rank
 
Normal rank

Latest revision as of 12:07, 24 June 2024

scientific article
Language Label Description Also known as
English
The complexity of Kemeny elections
scientific article

    Statements

    The complexity of Kemeny elections (English)
    0 references
    0 references
    0 references
    0 references
    20 March 2006
    0 references
    0 references
    computational complexity
    0 references
    election systems
    0 references
    parallel access to NP
    0 references
    0 references