Stratified functional programs and computational complexity
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Predictive recursion and computational complexity
Predictive recursion and computational complexity
A new recursion-theoretic characterization of the polytime functions
Computational Complexity
Function-algebraic characterizations of log and polylog parallel time
Computational Complexity
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
A characterization of alternating log time by ramified recurrence
Theoretical Computer Science - Trees in algebra and programming
Programming languages capturing complexity classes
ACM SIGACT News
Characterizing Parallel Time by Type 2 Recursions With Polynomial Output Length
LCC '94 Selected Papers from the International Workshop on Logical and Computational Complexity
A Characterization of NC by Tree Recurrence
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
The geometry of linear higher-order recursion
ACM Transactions on Computational Logic (TOCL)
Towards an implicit characterization of NCk
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
| Hi-index | 0.00 |
A typed lambda calculus with recursion in all finite types is defined such that the first order terms exactlyc haracterize the parallel complexityclass NC. This is achieved byuse of the appropriate forms of recursion (concatenation recursion and logarithmic recursion), a ramified type structure and imposing of a linearity constraint.