On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case
From MaRDI portal
DOI10.1016/0168-0072(89)90037-7zbMATH Open0711.03013OpenAlexW4213194823MaRDI QIDQ922525FDOQ922525
William Gasarch, Richard Beigel
Publication date: 1989
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0168-0072(89)90037-7
Recommendations
Coloring of graphs and hypergraphs (05C15) Complexity of computation (including implicit computational complexity) (03D15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Effective coloration
- An almost optimal algorithm for unbounded searching
- Recursive Colorings of Graphs
- Recursive coloration of countable graphs
- Searching, Merging, and Sorting in Parallel Computation
- Terse, superterse, and verbose sets
- Unbounded Searching Algorithms
- On the complexity of finding the chromatic number of a recursive graph. I: The bounded case
Cited In (8)
- Index sets for \(\Pi^0_1\) classes
- Feasible Graphs and Colorings
- The complexity of finding SUBSEQ\((A)\)
- Binary search and recursive graph problems
- Nondeterministic bounded query reducibilities
- Unbounded search and recursive graph problems
- Title not available (Why is that?)
- On the complexity of finding the chromatic number of a recursive graph. I: The bounded case
This page was built for publication: On the complexity of finding the chromatic number of a recursive graph. II: The unbounded case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q922525)
