论文信息 - On the Number Components of a Recursive Graph - 字舞流文

On the Number Components of a Recursive Graph

William I. Gasarch | Katia S. Guimarães | W. Gasarch | K. S. Guimaraes

[1] John Gill,et al. Terse, Superterse, and Verbose Sets , 1993, Inf. Comput..

[2] Martin Kummer. A Proof of Beigel's Cardinality Conjecture , 1992, J. Symb. Log..

[3] David Harel. Hamiltonian paths in infinite graphs , 1991, STOC '91.

[4] Richard Beigel. Unbounded Searching Slgorithms , 1990, SIAM J. Comput..

[5] William I. Gasarch,et al. On the Complexity of Finding the Chromatic Number of a Recursive Graph I: The Bounded Case , 1989, Ann. Pure Appl. Log..

[6] R. Soare. Recursively enumerable sets and degrees , 1987 .

[7] Andrew Chi-Chih Yao,et al. An Almost Optimal Algorithm for Unbounded Searching , 1976, Inf. Process. Lett..

[8] Alfred B. Manaster,et al. Effective matchmaking and -chromatic graphs , 1973 .

[9] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .

[10] R. Gallager. Information Theory and Reliable Communication , 1968 .