Two function algebras defining functions in NCk boolean circuits

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

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 Inc 01.06.2016
Subjects:	Boolean circuits formula omitted Parallel computation class Transducers Transducers Boolean circuits Parallel computation class NCk
ISSN:	0890-5401, 1090-2651
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!