On the complexity of finding the chromatic number of a recursive graph II: the unbounded case

&
Annals of Pure and Applied Logic 45 (3):227-246 (1989)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(89)90037-7

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,941

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

On the complexity of finding the chromatic number of a recursive graph I: the bounded case.Richard Beigel & William I. Gasarch - 1989 - Annals of Pure and Applied Logic 45 (1):1-38.
Filter spaces: towards a unified theory of large cardinal and embedding axioms BEIGEL, R., GASARCH, W. and OWINGS, J., Nondeterministic bounded query reducibilities. [REVIEW]A. Apter, C. Diprisco, J. Henle & W. Zwicker - 1989 - Annals of Pure and Applied Logic 41:299.
On the finiteness of the recursive chromatic number.William I. Gasarch & Andrew C. Y. Lee - 1998 - Annals of Pure and Applied Logic 93 (1-3):73-81.
Richard Beigel, William I. Gasarch, and Louise Hay. Bounded query classes and the difference hierarchy. Archive for mathematical logic, vol. 29 no. 2 , pp. 69–84. [REVIEW]Melven Krom - 1993 - Journal of Symbolic Logic 58 (1):359-360.
Descriptive complexity of graph spectra.Anuj Dawar, Simone Severini & Octavio Zapata - 2019 - Annals of Pure and Applied Logic 170 (9):993-1007.
The complexity of recursive constraint satisfaction problems.Victor W. Marek & Jeffrey B. Remmel - 2010 - Annals of Pure and Applied Logic 161 (3):447-457.
Downey, R., Gasarch, W. and Moses, M., The structure.S. D. Friedman, W. G. Handley, S. S. Wainer, A. Joyal, I. Moerdijk, L. Newelski, F. van Engelen & J. van Oosten - 1994 - Annals of Pure and Applied Logic 70 (1):287.
Generic objects in recursion theory II: Operations on recursive approximation spaces.A. Nerode & J. B. Remmel - 1986 - Annals of Pure and Applied Logic 31:257-288.
Unbounded towers and products.Piotr Szewczak & Magdalena Włudecka - 2021 - Annals of Pure and Applied Logic 172 (3):102900.
Complexity-theoretic algebra II: Boolean algebras.A. Nerode & J. B. Remmel - 1989 - Annals of Pure and Applied Logic 44 (1-2):71-99.

Analytics

Added to PP
2014-01-16

Downloads
33 (#662,452)

6 months
7 (#655,041)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Index sets for Π01 classes.Douglas Cenzer & Jeffrey Remmel - 1998 - Annals of Pure and Applied Logic 93 (1):3-61.
Nondeterministic bounded query reducibilities.Richard Beigel, William Gasarch & Jim Owings - 1989 - Annals of Pure and Applied Logic 41 (2):107-118.

Add more citations

References found in this work

Effective coloration.Dwight R. Bean - 1976 - Journal of Symbolic Logic 41 (2):469-480.
Recursive coloration of countable graphs.Hans-Georg Carstens & Peter Päppinghaus - 1983 - Annals of Pure and Applied Logic 25 (1):19-45.

Add more references