The Boolean formula value problem is in ALOGTIME
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Languages that capture complexity classes
SIAM Journal on Computing
Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
Journal of the ACM (JACM)
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
An optimal parallel algorithm for formula evaluation
SIAM Journal on Computing
Finite automata, formal logic, and circuit complexity
Finite automata, formal logic, and circuit complexity
The descriptive complexity approach to LOGCFL
Journal of Computer and System Sciences
Introduction to Circuit Complexity: A Uniform Approach
Introduction to Circuit Complexity: A Uniform Approach
A unified approach to models of synchronous parallel machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Deterministic CFL's are accepted simultaneously in polynomial time and log squared space
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
Definability of Languages by Generalized First-Order Formulas over $(\mathbb{N},+)$
SIAM Journal on Computing
Extensional Uniformity for Boolean Circuits
SIAM Journal on Computing
Non-definability of Languages by Generalized First-order Formulas over (N,+)
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
| Hi-index | 0.00 |
The effect of severely tightening the uniformity of Boolean circuit families is investigated. The impact on NC1 and its subclasses is shown to depend on the characterization chosen for the class, while classes such as P appear to be more robust. Tightly uniform subclasses of NC1 whose separation may be within reach of current techniques emerge.