Separating NC along the \(\delta\) axis
From MaRDI portal
Publication:1827390
DOI10.1016/j.tcs.2003.10.021zbMath1076.68030OpenAlexW2059588275WikidataQ56058326 ScholiaQ56058326MaRDI QIDQ1827390
Stephen J. Bellantoni, Isabel Oitavem
Publication date: 6 August 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2003.10.021
Related Items (4)
A recursion-theoretic approach to NP ⋮ Recursion Schemata for NC k ⋮ The polynomial hierarchy of functions and its levels ⋮ Implicit recursion-theoretic characterizations of counting classes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The realm of primitive recursion
- On uniform circuit complexity
- Arithmetizing uniform \(NC\)
- A new recursion-theoretic characterization of the polytime functions
- A query language for NC
- Higher type recursion, ramification and polynomial time
- The \(\mu\)-measure as a tool for classifying computational complexity
- Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms
- Simulation of Parallel Random Access Machines by Circuits
- Expressibility and Parallel Complexity
- Ranking Primitive Recursions: The Low Grzegorczyk Classes Revisited
- Hierarchies of Primitive Recursive Functions
This page was built for publication: Separating NC along the \(\delta\) axis
