Title :
On uniformity within NC1
Author :
Barrington, David A Miz ; Immerman, Neil ; Straubing, Howard
Author_Institution :
Dept. of Comput. & Inf. Sci., Massachusetts Univ., Amherst, MA, USA
Abstract :
The study of circuit complexity classes within NC1 in a uniform setting requires a uniformity condition that is more restrictive than those in common use. Two such conditions, stricter than NC1 uniformity, have appeared in recent research. It is shown that the two notions are equivalent, leading to a natural notion of uniformity for low-level circuit complexity classes, and that recent results on the structure of NC1 still hold true in this very uniform setting. A parallel notion of uniformity, still more restrictive, that is based on the regular languages is investigated. Characterizations of subclasses of the regular languages based on their logical expressibility are given
Keywords :
computational complexity; formal languages; NC1; circuit complexity classes; logical expressibility; regular languages; subclasses characterisation; uniformity; Circuits; Complexity theory; Educational institutions; NP-complete problem; Polynomials;
Conference_Titel :
Structure in Complexity Theory Conference, 1988. Proceedings., Third Annual
Conference_Location :
Washington, DC
Print_ISBN :
0-8186-0866-8
DOI :
10.1109/SCT.1988.5262