More complicated questions about maxima and minima, and some closures of NP
Theoretical Computer Science
The Boolean hierarchy I: structural properties
SIAM Journal on Computing
The Boolean hierarchy II: applications
SIAM Journal on Computing
NP-completeness of some problems concerning voting games
International Journal of Game Theory
Probabilistic polynomial time is closed under parity reductions
Information Processing Letters
On truth-table reducibility to SAT
Information and Computation
SIAM Journal on Computing
Kolmogorov characterizations of complexity classes
Theoretical Computer Science
PP is as hard as the polynomial-time hierarchy
SIAM Journal on Computing
Counting classes are at least as hard as the polynomial-time hierarchy
SIAM Journal on Computing
On complexity as bounded rationality (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Raising NP lower bounds to parallel NP lower bounds
ACM SIGACT News
Power balance and apportionment algorithms for the United States Congress
Journal of Experimental Algorithmics (JEA)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Borel sets and circuit complexity
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Generalized Kolmogorov complexity and the structure of feasible computations
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Reviews of THREE books on Fair Division of Resources
ACM SIGACT News
Theta2p-Completeness: A Classical Approach for New Results
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Guarantees for the success frequency of an algorithm for finding dodgson-election winners
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
This paper discusses three computation-related results in the study of electoral systems: 1. Determining the winner in Lewis Carroll's 1876 electoral system is complete for parallel access to NP [22]. 2. For any electoral system that is neutral, consistent, and Condorcet, determining the winner is complete for parallel access to NP [21]. 3. For each census in US history, a simulated annealing algorithm yields provably fairer (in a mathematically rigorous sense) congressional apportionments than any of the classic algorithms--even the algorithm currently used in the United States [24].