Towards a Theory of Recursive Structures
暂无分享,去创建一个
[1] David Harel,et al. Taking it to the limit: on infinite variants of NP-complete problems , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.
[2] Richard A. Shore,et al. On the strength of König's duality theorem for infinite bipartite graphs , 1992, J. Comb. Theory, Ser. B.
[3] David Harel,et al. Computable Queries for Relational Data Bases , 1980, J. Comput. Syst. Sci..
[4] Mihalis Yannakakis,et al. Optimization, approximation, and complexity classes , 1991, STOC '88.
[5] R. Rado. Universal graphs and universal functions , 1964 .
[6] Dwight R. Bean,et al. Recursive Euler and Hamilton paths , 1976 .
[7] Ronald Fagin,et al. Probabilities on finite models , 1976, Journal of Symbolic Logic.
[8] Moshe Y. Vardi. The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.
[9] Stefan A. Burr. Some undecidable problems involving the edge-coloring and vertex-coloring of graphs , 1984, Discret. Math..
[10] Phokion G. Kolaitis,et al. Logical Definability of NP Optimization Problems , 1994, Inf. Comput..
[11] Neil Immerman,et al. Relational Queries Computable in Polynomial Time , 1986, Inf. Control..
[12] Desh Ranjan,et al. Quantifiers and Approximation , 1993, Theor. Comput. Sci..
[13] Serge Abiteboul,et al. Generic Computation and its complexity , 1991, STOC '91.
[14] A. Manaster,et al. EFFECTIVE MATCHMAKING (RECURSION THEORETIC ASPECTS OF A THEOREM OF PHILIP HALL) , 1972 .
[15] Yiannis N. Moschovakis,et al. Elementary induction on abstract structures , 1974 .
[16] Jr. Hartley Rogers. Theory of Recursive Functions and Effective Computability , 1969 .
[17] David Harel,et al. More about recursive structures: descriptive complexity and zero-one laws , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.
[18] David Harel,et al. Completeness Results for Recursive Data Bases , 1996, J. Comput. Syst. Sci..
[19] David Harel,et al. Structure and complexity of relational queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).
[20] David Harel. Hamiltonian paths in infinite graphs , 1991, STOC '91.
[21] 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..
[22] Yu. V. Glebskii,et al. Range and degree of realizability of formulas in the restricted predicate calculus , 1969 .
[23] A. S. Morozov,et al. Functional trees and automorphisms of models , 1993 .