By Topic

Nondeterministic NC1 computation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Caussinus, H. ; Dept. d''Inf. et de Recherche Oper., Montreal Univ., Que., Canada ; Mckenzie, Pierre ; Therien, D. ; Vollmer, H.

We define the counting classes NC1, GapNC1 PNC1 and C=NC1. We prove that Boolean circuits, algebraic circuits, programs over nondeterministic finite automata, and programs over constant integer matrices yield equivalent definitions of the latter three classes. We investigate closure properties. We observe that NC1⊆L and that C=NC1⊆L. Then we exploit our finite automaton model and extend the padding techniques used to investigate leaf languages. Finally, we draw some consequences from the resulting body of leaf language characterizations of complexity classes, including the unconditional separation of ACC0 from MOD-PH as well as that of TC0 from the counting hierarchy. Moreover we obtain that dlogtime-uniformity and logspace-uniformity for AC0 coincide if and only if the polynomial time hierarchy equals PSPACE

Published in:

Computational Complexity, 1996. Proceedings., Eleventh Annual IEEE Conference on

Date of Conference:

24-27 May 1996