Skip to Main content Skip to Navigation
Conference papers

Recursion Schemata for NCk

Abstract : We give a recursion-theoretic characterization of the complexity classes NC k for k ≥ 1. In the spirit of implicit computational complexity, it uses no explicit bounds in the recursion and also no separation of variables is needed. It is based on three recursion schemes, one corresponds to time (time iteration), one to space allocation (explicit structural recursion) and one to internal computations (mutual in place recursion). This is, to our knowledge, the first exact characterization of NC k by function algebra over infinite domains in implicit complexity.
Document type :
Conference papers
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Jean-Yves Marion Connect in order to contact the contributor
Submitted on : Thursday, November 27, 2008 - 3:00:00 PM
Last modification on : Wednesday, November 10, 2021 - 5:18:05 PM
Long-term archiving on: : Monday, June 7, 2010 - 11:28:59 PM


Files produced by the author(s)




Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem. Recursion Schemata for NCk. 22nd International Workshop, CSL 2008, 17th Annual Conference of the EACSL, Bertinoro, Italy, September 16-19, 2008. Proceedings, Sep 2008, Bertinoro, Italy. pp.49-63, ⟨10.1007/978-3-540-87531-4_6⟩. ⟨hal-00342366⟩



Les métriques sont temporairement indisponibles