Θp2-completeness: A classical approach for new results

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1974, Issue , 2000, Pages 348-360

  Spakowski, Holger ^a   Vogel, Jörg ^b  

^a UNIVERSITY OF GREIFSWALD   (Germany)

^b FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; MACHINERY; POLYNOMIAL APPROXIMATION; SOFTWARE ENGINEERING;

BOOLEAN FORMULAE; CLASSICAL APPROACH; COMBINATORIAL PROBLEM; COMBINATORICS; OPTIMIZATION PROBLEMS; PARALLEL ACCESS TO NP; POLYNOMIAL-TIME; VOTING SCHEMES;

TURING MACHINES;

EID: 84947758667     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44450-5_28     Document Type: Conference Paper

References (16)

1. J. Bartholdi III, C.A. Tovey, M.A. Trick. Voting schemes for which it can be difficult to tell who won the election. Social Choice and Welfare 6 (1989), 157-165
2. M. Condorcet. Essai sur l’application de l’analyse àla probabilité des décisions rendues à la pluralité des voix. Paris, 1785
3. S.A. Cook. The complexity of theorem-proving procedures. Proceedings of the 3rd IEEE Symp. on the Foundations of Computer Science 1971, 524-535
4. P.C. Fishburn. Condorcet social choice functions. SIAM J Appl Math, 33 (1977), 469-489
5. M.R. Garey, D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Company,1979
6. E. Hemaspaandra, L. Hemaspaandra, J. Rothe. Exact Analysis of Dodgson Elections: Lewis Carroll’s 1876 Voting System is Complete for Parallel Access to NP. JACM, 44(6) (1997), 806-825
7. E. Hemaspaandra. The complexity of Kemeny elections. In preparation.
8. E. Hemaspaandra, L. Hemaspaandra. Computational Politics: Electoral Systems. Proceedings of MFCS 2000, LNCS 1893, 64-83
9. R.M. Karp. Reducibility among combinatorial problems, in R.E. Miller and J.W. Thatcher (eds.), Complexity of Computer Computations, Plenum Press, New York, 85-103
10. M. Krentel. The complexity of optimization problems. Journal of Computer and System Sciences, 36 (1988), 490-509
11. M. Machtey, P. Young. An Introduction to General Theory of Algorithms. North-Holland, New York, 1978
12. C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994
13. H. Spakowski, J. Vogel. The Operators minCh and maxCh on the Polynomial Hierarchy. Proceedings of FCT 99, LNCS 1684, 524-535
14. H. Spakowski, J. Vogel. The complexity of voting schemes — a method for proving completeness for parallel access to NP. Friedrich-Schiller-Universit¨at Jena, Jena, Germany, TR Math/Inf/00/16.
15. K.W. Wagner. More complicated questions about maxima an minima, and some closures of NP. Theoretical Computer Science, 51(1987), 53-80
16. K.W. Wagner. Bounded query classes. SIAM Journal on Computing, 19(1990), 833-846