On the complexity of finding the chromatic number of a recursive graph II: the unbounded case-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

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

Published:1989-12 Issue:3 Volume:45 Page:227-246
ISSN:0168-0072
Container-title:Annals of Pure and Applied Logic
language:en
Short-container-title:Annals of Pure and Applied Logic

Author:

Beigel Richard,Gasarch William I.

Publisher

Elsevier BV

Subject

Logic

Reference12 articles.

1. Effective coloration;Bean;J. Symbolic Logic,1976

2. R.J. Beigel, Unbounded searching algorithms, SIAM J. Comput., to appear.

3. On the complexity of finding the chromatic number of a recursive graph I: the bounded case;Beigel;Ann. Pure Appl. Logic,1989

4. Terse, superterse, and verbose sets;Beigel,1987

5. An almost algorithm for unbounded searching;Bentley;Inform. Process. Lett.,1976

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Complexity of Finding SUBSEQ(A);Theory of Computing Systems;2008-04-19

2. Index sets for Π01 classes;Annals of Pure and Applied Logic;1998-04

3. Chapter 16 A survey of recursive combinatorics;Studies in Logic and the Foundations of Mathematics;1998

4. Chapter 14 Computability theory and linear orderings;Studies in Logic and the Foundations of Mathematics;1998

5. Chapter 13 Π10 classes in mathematics;Studies in Logic and the Foundations of Mathematics;1998

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP