ON THE COMPLEXITY OF FINDING THE CHROMATIC NUMBER OF A RECURSIVE GRAPH-I - THE BOUNDED CASE

被引：17

作者：

BEIGEL, R ^{[1
]}

GASARCH, WI ^{[1
]}

机构：

[1] UNIV MARYLAND,DEPT COMP SCI,COLLEGE PK,MD 20742

来源：

关键词：

D O I：

10.1016/0168-0072(89)90029-8

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

引用

页码：1 / 38

页数：38

共 37 条

[1] POLYNOMIAL TERSE SETS
AMIR, A
GASARCH, WI
[J]. INFORMATION AND COMPUTATION, 1988, 77 (01) : 37 - 56
[2] AMIR A, 2090 U MAR DEPT COMP
[3] BEAN DR, 1976, P AM MATH SOC, V55, P385
[4] EFFECTIVE COLORATION
BEAN, DR
[J]. JOURNAL OF SYMBOLIC LOGIC, 1976, 41 (02) : 469 - 480
[5] NONDETERMINISTIC BOUNDED QUERY REDUCIBILITIES
BEIGEL, R
GASARCH, W
OWINGS, J
[J]. ANNALS OF PURE AND APPLIED LOGIC, 1989, 41 (02) : 107 - 118
[6] BEIGEL R, IN PRESS THEORET COM
[7] BEIGEL RJ, IN PRESS ANN PURE AP
[8] BEIGEL RJ, 7 J HOPK U DEP COMP
[9] BEIGEL RJ, 1805 U MAR COLL PARK
[10] BEIGEL RJ, 1987, 1806 U MAR COLL PARK