论文信息 - Logical Approaches to Computational Barriers: CiE 2006 - 字舞流文

Logical Approaches to Computational Barriers: CiE 2006

Benedikt Löwe | Arnold Beckmann | Dag Normann | D. Normann | B. Löwe | A. Beckmann

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

[2] Kate Copestake,et al. 1-genericity in the enumeration degrees , 1988, Journal of Symbolic Logic.

[3] S. Smale,et al. On a theory of computation and complexity over the real numbers; np-completeness , 1989 .

[4] Felipe Cucker,et al. Separation of Complexity Classes in Koiran's Weak Model , 1994, Theor. Comput. Sci..

[5] Lenore Blum,et al. Complexity and Real Computation , 1997, Springer New York.

[6] Yue Yang,et al. Bounding and nonbounding minimal pairs in the enumeration degrees , 2005, Journal of Symbolic Logic.

[7] Martín Matamala,et al. On digital nondeterminism , 1996, Mathematical systems theory.