Abstract
We define a hierarchy of term systems Tk by means of restrictions of the recursion schema. We essentially use a pointer technique together with tiering. We prove Tk ⊆ NCk ⊆ Tk+1, for k ≥ 2. Special attention is put on the description of T2 and T3 and on the proof of T2 ⊆ NC 2 ⊆ T3. Such a hierarchy yields a characterization of NC. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Bonfante, G., Kahle, R., Marion, J. Y., & Oitavem, I. (2006). Towards an implicit characterization of NCk. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4207 LNCS, pp. 212–224). Springer Verlag. https://doi.org/10.1007/11874683_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
