On the Complexity of Finding the Chromatic Number of a Recursive Graph II: The Unbounded Case

ABSTRACT We classify functions in recursive graph theory in terms of how many queries to K (or ∅ or ∅) are required to compute them. We show that (1) binary search is optimal (in terms of the number of queries to K) for finding the chromatic number of a recursive graph and that no set of Turing degree less than 0 will suffice, (2) determining if a recursive graph has a finite chromatic number is Σ2-complete, and (3) binary search is optimal (in terms of the number of queries to ∅) for finding the recursive chromatic number of a recursive graph and that no set of Turing degree less than 0 will suffice. We also explore how much help queries to a weaker set may provide. Some of our results have analogues in terms of asking p questions at a time, but some do not. In particular, (p+1)-ary search is not always optimal for finding the chromatic number of a recursive graph. Most of our results are also true for highly recursive graphs, though there are some interesting differences when queries to K are allowed for free in the computation of a recursive chromatic number.

[1]  Marc Snir,et al.  On Parallel Searching , 2011, SIAM J. Comput..

[2]  D. A. Bell,et al.  Information Theory and Reliable Communication , 1969 .

[3]  R. Beigel.  Query-limited reducibilities , 1988 .

[4]  Richard Beigel.  A structural theorem that depends quantitatively on the complexity of SAT , 1987, Computational Complexity Conference.

[5]  Mark W. Krentel.  The complexity of optimization problems , 1986, STOC '86.

[6]  Hans Georg Carstens,et al.  Recursive coloration of countable graphs , 1983, Ann. Pure Appl. Log..

[7]  R. Beigel,et al.  Bounded Queries to SAT and the Boolean Hierarchy , 1991, Theor. Comput. Sci..

[8]  James H. Schmerl.  Recursive colorings of graphs , 1980 .

[9]  Henry A. Kierstead,et al.  An effective version of Dilworth’s theorem , 1981 .

[10]  Helge Tverberg.  On Schmerl's effective version of Brooks' theorem , 1984, J. Comb. Theory, Ser. B.

[11]  James C. Owings,et al.  A cardinality version of Beigel's nonspeedup theorem , 1989, Journal of Symbolic Logic.

[12]  William I. Gasarch,et al.  Nondeterministic Bounded Query Reducibilities , 1989, Ann. Pure Appl. Log..

[13]  Hans Georg Carstens.  The Complexity of Some Combinatorial Constructions , 1977, Math. Log. Q..

[14]  Dwight R. Bean.  Effective Coloration , 1976, J. Symb. Log..

[15]  William I. Gasarch,et al.  On the Complexity of Finding the Chromatic Number of a Recursive Graph I: The Bounded Case , 1989, Ann. Pure Appl. Log..

[16]  Hsu-Chun Yen,et al.  Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning Omega-Machines , 1987, SIAM J. Comput..

[17]  R. Soare.  Recursively enumerable sets and degrees , 1987 .

[18]  Alfred B. Manaster,et al.  Effective matchmaking and -chromatic graphs , 1973 .

[19]  Amihood Amir,et al.  Polynomial Terse Sets , 1988, Inf. Comput..

[20]  Henry A. Kierstead.  An effective version of Hall’s theorem , 1983 .

[21]  Clyde P. Kruskal,et al.  Searching, Merging, and Sorting in Parallel Computation , 1983, IEEE Transactions on Computers.

[22]  Stefan A. Burr.  Some undecidable problems involving the edge-coloring and vertex-coloring of graphs , 1984, Discret. Math..

[23]  Klaus W. Wagner.  More Complicated Questions About Maxima and Minima, and Some Closures of NP , 1987, Theor. Comput. Sci..

[24]  Hans Georg Carstens.  A 5-Color-Extension-Theorem , 1987, Computation Theory and Logic.

[25]  Andrew Chi-Chih Yao,et al.  An Almost Optimal Algorithm for Unbounded Searching , 1976, Inf. Process. Lett..

[26]  H. Kierstead.  Recursive Colorings of Highly Recursive Graphs , 1981, Canadian Journal of Mathematics - Journal Canadien de Mathematiques.

[27]  D. C. Cooper,et al.  Theory of Recursive Functions and Effective Computability , 1969, The Mathematical Gazette.

[28]  William I. Gasarch,et al.  Bounded query classes and the difference hierarchy , 1989, Arch. Math. Log..

[29]  Gerd Wechsung,et al.  On the Boolean closure of NP , 1985, FCT.