Towards a theory of recursive structures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1450 LNCS, Issue , 1998, Pages 36-53

  Harel, David ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

QUERY LANGUAGES; OPTIMIZATION;

DATA BASIS; DESCRIPTIVE COMPLEXITY; INFINITARY; INFINITE OBJECTS; NP OPTIMIZATION PROBLEMS; RECURSIVE STRUCTURE; UNDECIDABILITY; ZERO-ONE LAW;

COMPUTATIONAL COMPLEXITY;

EID: 84896776688     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055756     Document Type: Conference Paper

References (31)

1. S. Abiteboul and V. Vianu, "Generic Computation and Its Complexity,", Proc. 23rd Ann. ACM Symp. on Theory of Computing, pp. 209-219, ACM Press, New York, 1991.
2. R. Aharoni, M. Magidor and R. A. Shore, "On the Strength of König's Duality Theorem,", J. of Combinatorial Theory (Series B) 54:2 (1992), 257-290.
3. D.R. Bean, "Effective Coloration,", J. Sym. Logic 41 (1976), 469-480.
4. D.R. Bean, "Recursive Euler and Hamiltonian Paths,", Proc. Amer. Math. Soc. 55 (1976), 385-394.
5. R. Beigel and W. I. Gasarch, unpublished results, 1986-1990.
6. R. Beigel and W. I. Gasarch, "On the Complexity of Finding the Chromatic Number of a Recursive Graph,", Parts I & II, Ann. Pure and Appl. Logic 45 (1989), 1-38, 227-247.
7. S. A. Burr, "Some Undecidable Problems Involving the Edge-Coloring and Vertex Coloring of Graphs,", Disc. Math. 50 (1984), 171-177.
8. A. K. Chandra and D. Harel, "Computable Queries for Relational Data Bases,", J. Comp. Syst. Sci. 21, (1980), 156-178.
9. A.K. Chandra and D. Harel, "Structure and Complexity of Relational Queries,", J. Comput. Syst. Sci. 25 (1982), 99-128.
10. R. Fagin, "Generalized First-Order Spectra and Polynomial-Time Recognizable Sets,", In Complexity of Computations (R. Karp, ed.), SIAM-AMS Proceedings, Vol. 7, 1974, pp. 43-73.
11. R. Fagin, "Probabilities on Finite Models,", J. of Symbolic Logic, 41, (1976), 50-58.
12. W. I. Gasarch and M. Lockwood, "The Existence of Matchings for Recursive and Highly Recursive Bipartite Graphs,", Technical Report 2029, Univ. of Maryland, May 1988.
13. Y. V. Glebskii, D. I. Kogan, M. I. Liogonki and V. A. Talanov, "Range and Degree of Realizability of Formulas in the Restricted Predicate Calculus,", Cybernetics 5, (1969), 142-154.
14. D. Harel, "Hamiltonian Paths in Infinite Graphs,", Israel J. Math. 76:3 (1991), 317-336
15. (Also, Proc. 23rd Ann. ACM Symp. on Theory of Computing, New Orleans, pp. 220-229, 1991.)
16. T. Hirst and D. Harel, "Taking it to the Limit: On Infinite Variants of NP-Complete Problems,", J. Comput. Syst. Sci., to appear
17. (Also, Proc. 8th IEEE Conf. on Structure in Complexity Theory, IEEE Press, New York, 1993, pp. 292-304.)
18. T. Hirst and D. Harel, "Completeness Results for Recursive Data Bases,", J. Comput. Syst. Sci., to appear
19. (Also, 12th ACM Ann. Symp. on Principles of Database Systems, ACM Press, New York, 1993, 244-252.)
20. T. Hirst and D. Harel, "More about Recursive Structures: Zero-One Laws and Expressibility vs. Complexity,", in preparation.
21. N. Immerman, "Relational Queries Computable in Polynomial Time,", Inf. and Cont. 68 (1986), 86-104.
22. P. G. Kolaitis and M. N. Thakur, "Logical definability of NP optimization problems,", 6th IEEE Conf. on Structure in Complexity Theory, pp. 353-366, 1991.
23. A. Manaster and J. Rosenstein, "Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall),", Proc. London Math. Soc. 3 (1972), 615-654.
24. A. S. Morozov, "Functional Trees and Automorphisms of Models,", Algebra and Logic 32 (1993), 28-38.
25. Y. N. Moschovakis, Elementary Induction on Abstract Structures, North Holland, 1974.
26. A. Nerode and J. Remmel, "A Survey of Lattices of R. E. Substructures,", In Recursion Theory, Proc. Symp. in Pure Math. Vol. 42 (A. Nerode and R. A. Shore, eds.), Amer. Math. Soc, Providence, R. I., 1985, pp. 323-375.
27. A. Panconesi and D. Ranjan, "Quantifiers and Approximation,", Theor. Comp. Sci. 107 (1993), 145-163.
28. C. H. Papadimitriou and M. Yannakakis, "Optimization, Approximation, and Complexity Classes,", J. Comp. Syst. Sci. 43, (1991), 425-440.
29. R. Rado, "Universal Graphs and Universal Functions,", Acta Arith., 9, (1964), 331-340.
30. H. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.
31. M. Y. Vardi, "The Complexity of Relational Query Languages,", Proc. 14th ACM Ann. Symp. on Theory of Computing, 1982, pp. 137-146.