Author:
Freire Cibele Matos,Martins Ana Teresa
Subject
General Computer Science,Theoretical Computer Science
Reference16 articles.
1. Fagin, R., Generalized first-order spectra and polynomial-time recognizable sets, 7, AMS Bookstore, 1974 pp. 43–73.
2. Expressibility of higher order logics;Hella;Eletronic Notes Theoretical Computer Science,2003
3. Computing queries with higher order logics;Hella;Theoretical Computer Science,2006
4. On the expressive power of database queries with intermediate types;Hull;Journal of Computer and System Sciences,1991
5. Immerman, N., Relational queries computable in polynomial time (extended abstract), in: STOC ʼ82: Proceedings of the fourteenth annual ACM symposium on Theory of computing (1982), pp. 147–152.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Capturing Bisimulation-Invariant Exponential-Time Complexity Classes;Electronic Proceedings in Theoretical Computer Science;2022-09-20