scientific article; zbMATH DE number 1759396
From MaRDI portal
Publication:4536344
zbMath0996.68065MaRDI QIDQ4536344
Edith Hemaspaandra, Hemaspaandra, Lane A.
Publication date: 4 November 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Voting theory (91B12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
Guarantees for the success frequency of an algorithm for finding Dodgson-election winners ⋮ Dichotomy for voting systems ⋮ A distance-based comparison of basic voting rules ⋮ On complexity of lobbying in multiple referenda ⋮ Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP ⋮ Anyone but him: the complexity of precluding an alternative
This page was built for publication:
