{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,7]],"date-time":"2024-01-07T00:01:41Z","timestamp":1704585701561},"reference-count":37,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,11,1]],"date-time":"1989-11-01T00:00:00Z","timestamp":625881600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8659,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[1989,11]]},"DOI":"10.1016\/0168-0072(89)90029-8","type":"journal-article","created":{"date-parts":[[2002,10,11]],"date-time":"2002-10-11T12:20:26Z","timestamp":1034338826000},"page":"1-38","source":"Crossref","is-referenced-by-count":26,"title":["On the complexity of finding the chromatic number of a recursive graph I: the bounded case"],"prefix":"10.1016","volume":"45","author":[{"given":"Richard","family":"Beigel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William I.","family":"Gasarch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0168-0072(89)90029-8_BIB1","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/0890-5401(88)90044-2","article-title":"Polynomial terse sets","volume":"77","author":"Amir","year":"1988","journal-title":"Information and Computation"},{"key":"10.1016\/0168-0072(89)90029-8_BIB2","unstructured":"A. Amir, W.I. Gasarch and R.J. Beigel, Cheatable, P-terse, and P-superterse sets, University of Maryland, Dept. of Computer Science, Tech. Rep. 2090."},{"key":"10.1016\/0168-0072(89)90029-8_BIB3","doi-asserted-by":"crossref","first-page":"469","DOI":"10.2307\/2272247","article-title":"Effective coloration","volume":"41","author":"Bean","year":"1976","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0168-0072(89)90029-8_BIB4","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1090\/S0002-9939-1976-0416888-0","article-title":"Recursive Euler and Hamiltonian paths","volume":"55","author":"Bean","year":"1976","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0168-0072(89)90029-8_BIB5","series-title":"Tech. Rep. 4","article-title":"SATA is terse with probability 1","author":"Beigel","year":"1987"},{"key":"10.1016\/0168-0072(89)90029-8_BIB6","series-title":"Tech. Rep. 10","article-title":"Functionally supportive sets","author":"Beigel","year":"1987"},{"key":"10.1016\/0168-0072(89)90029-8_BIB7","series-title":"Ph.D thesis","article-title":"Query limited reducibilities","author":"Beigel","year":"1987"},{"key":"10.1016\/0168-0072(89)90029-8_BIB8","unstructured":"R.J. Beigel, A structural theorem that depends quantitatively on the complexity of SAT, Theoret. Comput. Sci., to appear."},{"key":"10.1016\/0168-0072(89)90029-8_BIB9","unstructured":"R.J. Beigel, Bounded queries to SAT and the boolean hierarchy, Tech. Rep. 7, The Johns Hopkins University, Dept. of Computer Science."},{"key":"10.1016\/0168-0072(89)90029-8_BIB10","unstructured":"R.J. Beigel and W.I. Gasarch, Suppertive and parallel supportive sets. University of Maryland at College Park, Dept. of Computer Science, Tech. Rep. 1805"},{"key":"10.1016\/0168-0072(89)90029-8_BIB11","doi-asserted-by":"crossref","unstructured":"R.J. Beigel and W.I. Gasarch, On the complexity of finding the chromatic number of a recursive graph II: the unbounded case, Ann. Pure Appl. Logic, to appear.","DOI":"10.1016\/0168-0072(89)90037-7"},{"key":"10.1016\/0168-0072(89)90029-8_BIB12","series-title":"Tech. Rep. 1806","article-title":"Terse, superterse, and verbose sets","author":"Beigel","year":"1987"},{"key":"10.1016\/0168-0072(89)90029-8_BIB13","unstructured":"R.J. Beigel, W.I. Gasarch and L. Hay, Bounded queries classes and the difference hierarchy, Arch. Math. Logik."},{"key":"10.1016\/0168-0072(89)90029-8_BIB14","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0168-0072(89)90010-9","article-title":"Nondeterministic bounded query reducibilities","volume":"41","author":"Beigel","year":"1989","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0168-0072(89)90029-8_BIB15","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0012-365X(84)90046-3","article-title":"Some undecidable problems involving the edge-coloring and vertex coloring of graphs","volume":"50","author":"Burr","year":"1984","journal-title":"Discrete Math."},{"key":"10.1016\/0168-0072(89)90029-8_BIB16","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0168-0072(83)90052-0","article-title":"Recursive coloration of countable graphs","volume":"25","author":"Carstens","year":"1983","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/0168-0072(89)90029-8_BIB17","unstructured":"W.I. Gasarch, The complexity of optimization functions, University of Maryland, Dept. of Computer Science, Tech. Rep. 1652."},{"key":"10.1016\/0168-0072(89)90029-8_BIB18","unstructured":"W.I. Gasarch and M. Lockwood, The existence of matchings for recursive and highly recursive bipartite graphs, University of Maryland at College Park, Dept. of Computer Science, Tech. Rep. 2029."},{"key":"10.1016\/0168-0072(89)90029-8_BIB19","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/PSCT.1987.10319254","article-title":"Self-reducible, P-selective, near-testable, and P-cheatable sets: the effect of internal structure on the complexity of a set","author":"Goldsmith","year":"1987","journal-title":"Proc. 2nd Annual Conf. on Structure in Complexity Theory"},{"key":"10.1016\/0168-0072(89)90029-8_BIB20","first-page":"33","article-title":"PNP[logn] and sparse Turing-complete sets for NP","author":"Kadin","year":"1987","journal-title":"Proc. 2nd Annual Structure in Complexity Theory Conference"},{"key":"10.1016\/0168-0072(89)90029-8_BIB21","first-page":"63","article-title":"An effective version of Dilworth's theorem","volume":"268","author":"Kierstead","year":"1981","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/0168-0072(89)90029-8_BIB22","doi-asserted-by":"crossref","first-page":"1279","DOI":"10.4153\/CJM-1981-097-8","article-title":"Recursive colorings of highly recursive graphs","volume":"33","author":"Kierstead","year":"1981","journal-title":"Canad. J. Math."},{"key":"10.1016\/0168-0072(89)90029-8_BIB23","first-page":"124","article-title":"An effective version of Hall's theorem","volume":"88","author":"Kierstead","year":"1983","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0168-0072(89)90029-8_BIB24","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1016\/0022-0000(88)90039-6","article-title":"The complexity of optimization problems","volume":"36","author":"Krentel","year":"1988","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0168-0072(89)90029-8_BIB25","doi-asserted-by":"crossref","first-page":"942","DOI":"10.1109\/TC.1983.1676138","article-title":"Searching, merging, and sorting in parallel computation","volume":"32","author":"Kruskal","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0168-0072(89)90029-8_BIB26","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1112\/plms\/s3-25.4.615","article-title":"Effective matchmaking","volume":"25","author":"Manaster","year":"1972","journal-title":"Proc. London Math. Soc."},{"key":"10.1016\/0168-0072(89)90029-8_BIB27","first-page":"371","article-title":"Effective matchmaking and k-chromatic graphs","volume":"39","author":"Manaster","year":"1973","journal-title":"Proc. Amer. Math. Soc."},{"key":"10.1016\/0168-0072(89)90029-8_BIB28","doi-asserted-by":"crossref","DOI":"10.2307\/2274739","article-title":"A cardinality version of Beigel's nonspeedup theorem","author":"Owings","year":"1989","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0168-0072(89)90029-8_BIB29","series-title":"Theory of Recursive Functions and Effective Computability","author":"Rogers","year":"1967"},{"key":"10.1016\/0168-0072(89)90029-8_BIB30","doi-asserted-by":"crossref","first-page":"779","DOI":"10.1137\/0216052","article-title":"Logspace hierarchies, polynomial time, and the complexity of fairness problems concerning \u03c9-machines","volume":"16","author":"Rosier","year":"1987","journal-title":"SIAM J. Comput"},{"key":"10.1016\/0168-0072(89)90029-8_BIB31","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.4153\/CJM-1982-075-6","article-title":"The effective version of Brooks theorem","volume":"34","author":"Schmerl","year":"1982","journal-title":"Canad. J. Math."},{"key":"10.1016\/0168-0072(89)90029-8_BIB32","doi-asserted-by":"crossref","first-page":"821","DOI":"10.4153\/CJM-1980-062-7","article-title":"Recursive colorings of graphs","volume":"32","author":"Schmerl","year":"1980","journal-title":"Canad. J. Math."},{"key":"10.1016\/0168-0072(89)90029-8_BIB33","doi-asserted-by":"crossref","first-page":"688","DOI":"10.1137\/0214051","article-title":"On parallel searching","volume":"14","author":"Snir","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0168-0072(89)90029-8_BIB34","series-title":"Omega Series","article-title":"Recursively Enumerable Sets and Degrees","author":"Soare","year":"1987"},{"key":"10.1016\/0168-0072(89)90029-8_BIB35","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0095-8956(84)90041-8","article-title":"On Schmerl's effective version of Brooks' theorem","volume":"37","author":"Tverberg","year":"1984","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0168-0072(89)90029-8_BIB36","first-page":"434","article-title":"More complicated questions about maxima and minima and some closures of NP","volume":"226","author":"Wagner","year":"1986"},{"key":"10.1016\/0168-0072(89)90029-8_BIB37_1","first-page":"485","article-title":"On the boolean closure of NP","volume":"199","author":"Wechsung","year":"1986"}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0168007289900298?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0168007289900298?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,1,6]],"date-time":"2024-01-06T09:30:41Z","timestamp":1704533441000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0168007289900298"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,11]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,11]]}},"alternative-id":["0168007289900298"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(89)90029-8","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1989,11]]}}}