FO[<]-uniformity
Christoph Behle, K.-J. Lange · Conference on Computational Complexity · 2006
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.