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...

Celý popis

Podrobná bibliografia

Vydané v:	Information and computation Ročník 248; s. 82 - 103
Hlavní autori:	Bonfante, Guillaume, Kahle, Reinhard, Marion, Jean-Yves, Oitavem, Isabel
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Inc 01.06.2016
Predmet:	Boolean circuits formula omitted Parallel computation class Transducers Transducers Boolean circuits Parallel computation class NCk
ISSN:	0890-5401, 1090-2651
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!