Author:
Leivant Daniel,Marion Jean-Yves
Subject
General Computer Science,Theoretical Computer Science
Reference20 articles.
1. S. Bellantoni, Characterizing parallel time by type 2 recursions with polynomial output length, in: D. Leivant (Ed.), Logic and Computational Complexity, Lecture Notes in Computer Science, Vol. 960, Springer, Berlin, pp. 253–268.
2. A new recursion-theoretic characterization of the poly-time functions;Bellantoni;Comput. Complexity,1992
3. Function-algebraic characterizations of log and polylog parallel time;Bloch;Comput. Complexity,1994
4. Alternation
5. Computation models and function algebras;Clote,1997
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Algorithmically Broad Languages for Polynomial Time and Space;Logic, Language, Information, and Computation;2021
2. Pointers in Recursion: Exploring the Tropics;Electronic Proceedings in Theoretical Computer Science;2019-08-14
3. Two function algebras defining functions in NCk boolean circuits;Information and Computation;2016-06
4. Church => Scott = Ptime: an application of resource sensitive realizability;Electronic Proceedings in Theoretical Computer Science;2010-05-05
5. On tiered small jump operators;Logical Methods in Computer Science;2009-03-31