Towards an Implicit Characterization of NC k

DOI10.1007/11874683_14zbMath1225.68091OpenAlexW1554087892MaRDI QIDQ3613339

Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem, Guillaume Bonfante

Publication date: 12 March 2009

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11874683_14

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (5)

A Characterization of NC k by First Order Functional Programs ⋮ Subclasses of \textsc{Ptime} interpreted by programming languages ⋮ A recursion-theoretic approach to NP ⋮ Recursion Schemata for NC k ⋮ Implicit characterizations of FPTIME and NC revisited

This page was built for publication: Towards an Implicit Characterization of NC k