Two function algebras defining functions in NC k boolean circuits

We describe the functions computed by boolean circuits in NCk by means of func- tions algebra for k ≥ 1 in the spirit of implicit computational complexity. The whole hierarchy defines NC. In other words, we give a recursion-theoretic charac- terization of the complexity classes NCk for k ≥ 1 without...

Full description

Bibliographic Details

Published in:	Information and computation Vol. 248; pp. 82 - 103
Main Authors:	Bonfante, Guillaume, Kahle, Reinhard, Marion, Jean-Yves, Oitavem, Isabel
Format:	Journal Article
Language:	English
Published:	Elsevier 01.06.2016
Subjects:	Computational Complexity Computer Science parallel computation class transducers Boolean circuits NCk
ISSN:	0890-5401, 1090-2651
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!