Completeness in the Boolean hierarchy: Exact-four-colorability, minimal graph uncolorability, and exact domatic number problems - A survey

Journal of Universal Computer Science

Volumn 12, Issue 5, 2006, Pages 551-578

  Riege, Tobias ^a   Rothe, Jörg ^a  

^a HEINRICH HEINE UNIVERSITY   (Germany)

Author keywords

Boolean hierarchy; Completeness; Exact colorability; Exact domatic number; Minimal uncolorability

Indexed keywords

EID: 33745742078     PISSN: 0958695X     EISSN: 09486968     Source Type: Journal    
DOI: None     Document Type: Article

References (69)

1. [AH77a] K. Appel and W. Haken. Every planar map is 4-colorable - 1: Discharging. Illinois J. Math, 21:429-490, 1977.
2. [AH77b] K. Appel and W. Haken. Every planar map is 4-colorable - 2: Reducibility. Illinois J. Math, 21:491-567, 1977.
3. [ALM+98] S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and intractability of approximation problems. Journal of the ACM, 45(3):501-555, May 1998.
4. [Bon85] M. Bonuccelli. Dominating sets and dominating number of circular arc graphs. Discrete Applied Mathematics, 12:203-213, 1985.
5. [BTT89a] J. Bartholdi III, C. Tovey, and M. Trick. The computational difficulty of manipulating an election. Social Choice and Welfare, 6(3):227-241, 1989.
6. [BTT89b] 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(2):157165, 1989.
7. [BTT92] J. Bartholdi III, C. Tovey, and M. Trick. How hard is it to control an election? Mathematical Comput. Modelling, 16(8/9):27-40, 1992.
8. +88] 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.
9. +89] J. Cai, T. Gundermann, J. Hartmanis, L. Hemachandra, V. Sewelson, K. Wagner, and G. Wechsung. The boolean hierarchy II: Applications. SIAM Journal on Computing, 18(1):95-111, 1989.
10. [CH77] E. Cockayne and S. Hedetniemi. Towards a theory of domination in graphs. Networks, 7:247-261, 1977.
11. [CH86] J. Cai and L. Hemachandra. The boolean hierarchy: Hardware over NP. In Proceedings of the 1st Structure in Complexity Theory Conference, pages 105-124. Springer-Verlag Lecture Notes in Computer Science #223, June 1986.
12. [CLS03] V. Conitzer, J. Lang, and T. Sandholm. How many candidates are needed to make elections hard to manipulate? In Proceedings of the 9th Conference on Theoretical Aspects of Rationality and Knowledge, pages 201-214. ACM Press, 2003.
13. P-complete. SIAM Journal on Computing, 16(2):259-277, April 1987.
14. [CS02a] V. Conitzer and T. Sandholm. Complexity of manipulating elections with few candidates. In Proceedings of the 18th National Conference on Artificial Intelligence, pages 314-319. AAAI Press, 2002.
15. [CS02b] V. Conitzer and T. Sandholm. Vote elicitation: Complexity and strategy-proofness. In Proceedings of the 18th National Conference on Artificial Intelligence, pages 392-397. AAAI Press, 2002.
16. p Recent results and applications. In Proceedings of the 11th Conference on Fundamentals of Computation Theory, pages 1-18. Springer-Verlag Lecture Notes in Computer Science #1279, September 1997.
17. [Far84] M. Farber. Domination, independent domination, and duality in strongly chordal graphs. Discrete Applied Mathematics, 7:115-130, 1984.
18. [FHK00] U. Feige, M. Halldórsson, and G. Kortsarz. Approximating the domatic number. In Proceedings of the 32nd ACM Symposium on Theory of Computing, pages 134-143. ACM Press, May 2000.
19. [GJ79] M. Garey and D. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, 1979.
20. [GJS76] M. Garey, D. Johnson, and L. Stockmeyer. Some simplified NP-complete graph problems. Theoretical Computer Science, 1:237-267, 1976.
21. [GK00] 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.
22. [GNW90] T. Gundermann, N. Nasser, and G. Wechsung. A survey on counting classes. In Proceedings of the 5th Structure in Complexity Theory Conference, pages 140-153. IEEE Computer Society Press, July 1990.
23. [GRW01a] A. Große, J. Rothe, and G. Wechsung. A note on the complexity of computing the smallest four-coloring of planar graphs. Technical Report cs.CC/0106045, Computing Research Repository (CoRR,), June 2001. Available on-line at http://xxx.lanl.gov/abs/cs.CC/0106045.
24. [GRW01b] A. Große, J. Rothe, and G. Wechsung. Relating partial and complete solutions and the complexity of computing smallest solutions. In Proceedings of the Seventh Italian Conference on Theoretical Computer Science, pages 339-356. Springer-Verlag Lecture Notes in Computer Science #2202, October 2001.
25. [GW87] T. Gundermann and G. Wechsung. Counting classes with finite acceptance types. Computers and Artificial Intelligence, 6(5):395-409, 1987.
26. [Hem87] L. Hemachandra. The strong exponential hierarchy collapses. In Proceedings of the 19th ACM Symposium on Theory of Computing, pages 110-122. ACM Press, May 1987.
27. [HH00] E. Hemaspaandra and L. Hemaspaandra. Computational politics: Electoral systems. In Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science, pages 64-83. Springer-Verlag Lecture Notes in Computer Science #1893, 2000.
28. [HHH98] E. Hemaspaandra, L. Hemaspaandra, and H. Hempel. What's up with downward collapse: Using the easy-hard technique to link boolean and polynomial hierarchy collapses. SIGACT News, 29(3):10-22, 1998.
29. [HHR97a] 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, November 1997.
30. [HHR97b] E. Hemaspaandra, L. Hemaspaandra, and J. Rothe. Raising NP lower bounds to parallel NP lower bounds. SIGACT News, 28(2):2-13, June 1997.
31. [HHR05] E. Hemaspaandra, L. Hemaspaandra, and J. Rothe. Anyone but him: The complexity of precluding an alternative. In Proceedings of the 20th National Conference on Artificial Intelligence, pages 95-101. AAAI Press, 2005.
32. [HR98] E. Hemaspaandra and J. Rothe. Recognizing when greed can approximate maximum independent sets is complete for parallel access to NP. Information Processing Letters, 65(3):151-156, February 1998.
33. [HRS06] E. Hemaspaandra, J. Rothe, and H. Spakowski. Recognizing when heuristics can approximate minimum vertex covers is complete for parallel access to NP. R.A.I.R.O. Theoretical Informatics and Applications, 40(1):75-91, 2006.
34. [HSV05] E. Hemaspaandra, H. Spakowski, and J. Vogel. The complexity of Kemeny elections. Theoretical Computer Science, 349(3):382-391, December 2005.
35. [HT98] P. Heggernes and J. Telle. Partitioning graphs into generalized dominating sets. Nordic Journal of Computing, 5(2):128-142, 1998.
36. [HW91] L. Hemachandra and G. Wechsung. Kolmogorov characterizations of complexity classes. Theoretical Computer Science, 83:313-322, 1991.
37. [HW97] E. Hemaspaandra and G. Wechsung. The minimization problem for boolean formulas. In Proceedings of the 38th IEEE Symposium on Foundations of Computer Science, pages 575-584. IEEE Computer Society Press, October 1997.
38. [HW02] E. Hemaspaandra and G. Wechsung. The minimization problem for boolean formulas. SIAM Journal on Computing, 31(6):1948-1958, 2002.
39. [Kad88] J. Kadin. The polynomial time hierarchy collapses if the boolean hierarchy collapses. SIAM Journal on Computing, 17(6):1263-1282, 1988. Erratum appears in the same journal, 20(2):404, 1991.
40. NP[log n] and sparse Turing-complete sets for NP. Journal of Computer and System Sciences, 39(3):282-298, 1989.
41. [KLS00] S. Khanna, N. Linial, and S. Safra. On the hardness of approximating the chromatic number. Combinatorica, 20(3):393-415, 2000.
42. [Kre88] M. Krentel. The complexity of optimization problems. Journal of Computer and System Sciences, 36:490-509, 1988.
43. [KS94] H. Kaplan and R. Shamir. The domatic number problem on some perfect graph families. Information Processing Letters, 49(1):51-56, January 1994.
44. [KSW87] J. Köbler, U. Schöning, and K. Wagner. The difference and truth-table hier-archies for NP. R.A.I.R.O. Informatique théorique et Applications, 21:419-435, 1987.
45. [KV91] S. Khuller and V. Vazirani. Planar graph coloring is not self-reducible, as-suming P ≠ NP. Theoretical Computer Science, 88(1):183-189, 1991.
46. [LS95] T. Long and M. Sheu. A refinement of the low and high hierarchies. Mathematical Systems Theory, 28(4):299-327, July/August 1995.
47. [MS72] A. Meyer and L. Stockmeyer. The equivalence problem for regular expressions with squaring requires exponential space. In Proceedings of the 13th IEEE Symposium on Switching and Automata Theory, pages 125-129, 1972.
48. [Pap94] C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
49. [PW88] C. Papadimitriou and D. Wolfe. The complexity of facets resolved. Journal of Computer and System Sciences, 37(1):2-13, 1988.
50. [PY84] 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.
51. [PZ83] C. Papadimitriou and S. Zachos. Two remarks on the power of counting. In Proceedings of the 6th GI Conference on Theoretical Computer Science, pages 269-276. Springer-Verlag Lecture Notes in Computer Science #145, 1983.
52. [Rot00] J. Rothe. Heuristics versus completeness for graph coloring. Chicago Journal of Theoretical Computer Science, vol. 2000, article 1:1-16, February 2000.
53. [Rot03] J. Rothe. Exact complexity of Exact-Four-Colorability. Information Processing Letters, 87(1):7-12, July 2003.
54. [Rot04] J. Rothe. Exact-Four-Colorability, exact domatic number problems, and the boolean hierarchy. In H. Buhrman, L. Fortnow, and T. Thierauf, editors, Dagstuhl Seminar 04421: "Algebraic Methods in Computational Complexity". Dagstuhl Seminar Proceedings, October 2004. Available on-line at http://drops.dagstuhl.de/opus/volltexte/2005/105/pdf/04421.RotheJoerg.Paper. 105.pdf.
55. [Rot05] J. Rothe. Complexity Theory and Cryptology. An Introduction to Cryptocomplexity. EATCS Texts in Theoretical Computer Science. Springer-Verlag, Berlin, Heidelberg, New York, 2005.
56. [RR04a] T. Riege and J. Rothe. Complexity of the exact domatic number problem and of the exact conveyor flow shop problem. Theory of Computing Systems, December 2004. On-line publication DOI 10.1007/s00224-004-1209-8. Paper publication to appear.
57. [RR04b] T. Riege and J. Rothe. Complexity of the exact domatic number problem and of the exact conveyor flow shop problem. In Proceedings of the First IEEE International Conference on Information & Communication Technologies: From Theory to Applications, pages 653-654. IEEE Computer Society Press, April 2004. A six-page extended abstract is available from CD-ROM ISBN 0-7803-8483-0.
58. [RR05] T. Riege and J. Rothe. An exact 2.9416" algorithm for the three domatic number problem. In Proceedings of the 90th International Symposium on Mathematical Foundations of Computer Science, pages 733-744. Springer-Verlag Lecture Notes in Computer Science #3618, August 2005.
59. [RRSY06] T. Riege, J. Rothe, H. Spakowski, and M. Yamamoto. An improved exact algorithm for the domatic number problem. In Proceedings of the Second IEEE International Conference on Information & Communication Technologies: From Theory to Applications, pages 1021-1022. IEEE Computer Society Press, April 2006. A six-page extended abstract is available from CD-ROM.
60. [RSV02] J. Rothe, H. Spakowski, and J. Vogel. Exact complexity of Exact-Four-Colorability and of the winner problem for Young elections. In R. Baeza-Yates, U. Montanari, and N. Santoro, editors, Foundations of Information Technology in the Era of Network and Mobile Computing, pages 310-322. Kluwer Academic Publishers, August 2002. Proceedings of the 17th IFIP World Computer Congress/2nd IFIP International Conference on Theoretical Computer Science.
61. [RSV03] J. Rothe, H. Spakowski, and J. Vogel. Exact complexity of the winner problem for Young elections. Theory of Computing Systems, 36(4):375-386, June 2003.
62. [Sch78] T. Schaefer. The complexity of satisfiability problems. In Proceedings of the 10th ACM Symposium on Theory of Computing, pages 216-226. ACM Press, May 1978.
63. [Sto73] L. Stockmeyer. Planar 3-colorability is NP-complete. SIGACT News, 5(3):19-25, 1973.
64. [Sto77] L. Stockmeyer. The polynomial-time hierarchy. Theoretical Computer Science, 3(1):1-22, 1977.
65. p-completens: 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.
66. [Uma01] C. Umans. The minimum equivalent DNF problem and shortest implicants. Journal of Computer and System Sciences, 63(4):597-611, 2001.
67. [Wag87] K. Wagner. More complicated questions about maxima and minima, and some closures of NP. Theoretical Computer Science, 51:53-80, 1987.
68. [Wag90] K. Wagner. Bounded query classes. SIAM Journal on Computing, 19(5):833-846, 1990.
69. [Wec85] G. Wechsung. On the boolean closure of NP. In Proceedings of the 5th Conference on Fundamentals of Computation Theory, pages 485-493. Springer-Verlag Lecture Notes in Computer Science #199, 1985. (An unpublished precursor of this paper was coauthored by K. Wagner).