Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. J. Barwise, Admissible Sets and Structures, Springer, Berlin 1975
2. A. Chandra, D. Harel, Computable Queries of Relational Data Bases, JCSS 21.2 (1980), p. 156–178.
3. S. Cook, A Taxonomy of Problems with Fast Parallel Algorithms, Information and Control 64 (1985), pp. 2–22.
4. E. Dahlhaus, J. Makowsky, Computable Directory Queries, CAAP 86, LNCS 214, pp. 254–265.
5. E. Dahlhaus, J. Makowsky, The Choice of Programming Primitives in SETL-Like Languages, ESOP 86, LNCS 213, pp. 160–172.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献