Author:
Tasharrofi Shahab,Ternovska Eugenia
Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. Bellantoni, S., Cook, S.: A new recursion-theoretic characterization of the polytime functions (extended abstract). In: STOC 1992: Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, pp. 283–293 (1992)
2. Buss, S.R.: Bounded arithmetic. PhD thesis, Princeton University (1985)
3. Lecture Notes in Computer Science;M. Cadoli,1999
4. Chandra, A., Harel, D.: Computable queries for relational databases. Journal of Computer and System Sciences 21, 156–178 (1980)
5. Cobham, A.: The intrinsic computational difficulty of functions. In: Bar-Hillel, Y. (ed.) Proc. of the 1964 International Congress for Logic, Methodology, and the Philosophy of Science, pp. 24–30 (1964)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Enfragmo: A System for Modelling and Solving Search Problems with Logic;Logic for Programming, Artificial Intelligence, and Reasoning;2012
2. On the Complexity of Model Expansion;Logic for Programming, Artificial Intelligence, and Reasoning;2010