Exact complexity of exact-fourcolorability and of the winner problem for young elections

IFIP Advances in Information and Communication Technology

Volumn 96, Issue , 2002, Pages 310-322

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

^a HEINRICH HEINE UNIVERSITY   (Germany)

^b FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

Boolean hierarchy; Completeness; Computational complexity; Graph colorability; Voting schemes

Indexed keywords

COMPLEX NETWORKS; COMPUTATIONAL COMPLEXITY; LINEAR PROGRAMMING; POLYNOMIAL APPROXIMATION;

BOOLEAN HIERARCHY; CHROMATIC NUMBER; COLORABILITY; COMPLETENESS; CONDORCET WINNER; PARALLEL ACCESS TO NP; RANKING PROBLEMS; VOTING SCHEMES;

COMPUTER HARDWARE DESCRIPTION LANGUAGES;

EID: 84891117576     PISSN: 18684238     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-0-387-35608-2_26     Document Type: Article

References (29)

1. K. Arrow. Social Choice and Individual Values. John Wiley and Sons, 1951 (revised editon 1963).
2. J. Bartholdi III, C. Tovey, and M. Trick. Voting schemes for which it can be difficult to tell who won the election. Social Choice and Welfare, 6:157-165, 1989.
3. D. Black. The Theory of Committees and Elections. Cambridge University Press, 1958.
4. J. Cai, T. Gundermann, J. Hartmanis, L. Hemachandra, V. Sewelson, K. Wagner, and G. Wechsung. The boolean hierarchy I: Structural properties. SIAM Journal on Computing, 17(6):1232-1252, 1988.
5. J. Cai and G. Meyer. Graph minimal uncolorability is DP-complete. SIAM Journal on Computing, 16(2):259-277, April 1987.
6. G. Chapman. The Complete Monty Python's Flying Circus: All the Words. Pantheon Books, 1989.
7. M. J. A. N. de Caritat, Marquis de Condorcet. Essai sur!'application de!'analyse á la probabilité des décisions rendues á la pluraliste des voix. 1785. Facsimile reprint of original published in Paris, 1972, by the lmprimerie Royale. English translation appears in I. McLean and A. Urken, Classics of Social Choice, University of Michigan Press, 1995, pages 91-112.
8. C. Dodgson. A method of taking votes on more than two issues. Pamphlet printed by the Clarendon Press, Oxford, and headed "not yet published (see the discussions in [21, 3], both of which reprint this paper), 1876.
9. P. Fishburn. Condorcet social choice functions. SIAM Journal on Applied Mathematics, 33:469-489, 1977.
10. M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.
11. V. Guruswami and S. Khanna. On the hardness of 4-coloring a 3-colorable graph. In Proceedings of the 15th Annual IEEE Conference on Computational Complexity, pages 188-197. IEEE Computer Society Press, May 2000.
12. L. Hallijan. A polynomial algorithm in linear programming. Soviet Math. Dokl., 20:191-194, 1979.
13. F. Hausdorff. Grundzii.ge der Mengenlehre. Walter de Gruyten and Co., 1914.
14. E. Hemaspaandra and L. Hemaspaandra. Computational politics: Electoral systems. In Proceedings of the S5th International Symposium on Mathematical Foundations of Computer Science, pages 64-83. Springer-Verlag Lecture Notes in Computer Science #1899, 2000.
15. E. Hemaspaandra, L. Hemaspaandra, and J. Rothe. Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP. Journal of the ACM, 44(6):806-825, 1997.
16. E. Hemaspaandra, J. Rothe, and H. Spakowski. Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP. In Proceedings of the 28th International Workshop on Graph-Theoretical Concepts in Computer Science {WG 2002}, June 2002. To appear.
17. L. Hemaspaandra and J. Rothe. Unambiguous computation: Boolean hierarchies and sparse Turing-complete sets. SIAM Journal on Computing, 26(3):634-653, 1997.
18. N. Karmarkar. A new polynomial-time algorithm for linear programming. Combinatorica, 4(4):373-395, 1984.
19. S. Khanna, N. Linial, and S. Safra. On the hardness of approximating the chromatic number. Combinatorica, 20(3):393-415, 2000.
20. J. Kobler, U. Schoning, and K. Wagner. The difference and truth-table hierarchies for NP. R.A.I.R.O. Informatique theorique et Applications, 21:419-435, 1987.
21. I. McLean and A. Urken. Classics of Social Choice. University of Michigan Press, Ann Arbor, Michigan, 1995.
22. C. Papadimitriou and M. Yannakakis. The complexity of facets (and some facets of complexity). Journal of Computer and System Sciences, 28(2):244-259, 1984.
23. J. Rothe. Exact complexity of Exact-Four-Colorability. Technical Report cs.CC/0109018, Computing Research Repository (CoRR), September 2001. 5 pages. Available on-line at http://xxx.lanl.gov/abs/cs.CC/0109018.
24. J. Rothe, H. Spakowski, and J. Vogel. Exact complexity of the winner problem for Young elections. Technical Report cs.CC/0112021, Computing Research Repository (CoRR), December 2001. 10 pages. Available on-line at http://xxx.lanl.gov /abs/cs.CC/0112021.
25. H. Spakowski and J. Vogel. Op2: A classical approach for new results. In Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science, pages 348-360. Springer-Verlag Lecture Notes in Computer Science #1974, December 2000.
26. H. Spakowski and J. Vogel. The complexity of Kemeny's voting system. In Proceedings of the 5th Argentinian Workshop on Theoretical Computer Science, pages 157-168, 2001.
27. K. Wagner. More complicated questions about maxima and minima, and some closures of NP. Theoretical Computer Science, 51:53-80, 1987.
28. K. Wagner. Bounded query classes. SIAM Journal on Computing, 19(5):833-846, 1990.
29. H. Young. Extending Condorcet's rule. Journal of Economic Theory, 16:335-353, 1977.