A typed lambda calculus with recursion in all finite types is defined such that the first order terms exactly characterize the parallel complexity class NC.
Oct 2, 2001 · A typed lambda calculus with recursion in all finite types is defined such that the first order terms exactlyc haracterize the parallel ...
A typed lambda calculus with recursion in all finite types is defined such that the first order terms exactlyc haracterize the parallel complexityclass NC.
One of the most prominent complexity classes, other than polynomial time, is the class NC of functions computable in parallel polylogarithmic time with a.
A typed lambda calculus with recursion in all finite types is defined such that the first order terms exactlycharacterize the parallel complexityclass NC.
"Linear ramified higher type recursion and parallel complexity". Date, 2001. In, Proof theory in computer science (Dagstuhl Castle, 2001). Volume, 2183. Series ...
Jul 15, 2000 · It is shown how to restrict recursion on notation in all finite types so as to characterize the polynomial-time computable functions.
A typed lambda calculus with recursion in all finite types is defined such that the first order terms exactlyc haracterize the parallel complexityclass NC.
Abstract. It is shown how to restrict recursion on notation in all finite types so as to characterize the polynomial-time computable functions.
Jun 20, 2005 · Linearity and ramification constraints have been widely used to weaken higher-order (primitive) recursion in such a way that the class of ...
Missing: Type Parallel