Author :
Behle, Christoph ; Lange, Klaus-Jörn
Author_Institution :
Wilhelm-Schickard-Inst. fur Informatik, Eberhard-Karls-Univ. Tubingen
Abstract :
Uniformity notions more restrictive than the usual FO[<, +, *]-uniformity = FO[<, Bit]-uniformity are introduced. It is shown that the general framework exhibited by Barrington et al. still holds if the fan-in of the gates in the corresponding circuits is considered
Keywords :
circuit complexity; formal logic; FO[<]-uniformity; complexity classes; uniformity notion; Computational complexity;
Conference_Titel :
Computational Complexity, 2006. CCC 2006. Twenty-First Annual IEEE Conference on
Conference_Location :
Prague
Print_ISBN :
0-7695-2596-2
DOI :
10.1109/CCC.2006.20
