The following pages link to David A. Mix Barrington (Q386052):
Displaying 24 items.
- Corrigendum to: ``Uniform constant-depth threshold circuits for division and iterated multiplication'' (Q386053) (← links)
- Planar and grid graph reachability problems (Q733742) (← links)
- Non-uniform automata over groups (Q804303) (← links)
- On the relative complexity of some languages in \(NC^ 1\) (Q1124355) (← links)
- Oracle branching programs and Logspace versus \(P^*\) (Q1183604) (← links)
- Regular languages in \(NC\) (Q1191027) (← links)
- A lower bound on the MOD 6 degree of the OR function (Q1272657) (← links)
- Complex polynomials and circuit lower bounds for modular counting (Q1346614) (← links)
- Representing Boolean functions as polynomials modulo composite numbers (Q1346617) (← links)
- Lower bounds for modular counting by circuits with modular gates (Q1590077) (← links)
- First-order expressibility of languages with neutral letters or: The Crane Beach conjecture (Q1776372) (← links)
- Uniform constant-depth threshold circuits for division and iterated multiplication. (Q1872733) (← links)
- Superlinear lower bounds for bounded-width branching programs (Q1894446) (← links)
- A note on some languages in uniform \(ACC^ 0\) (Q2638770) (← links)
- On uniformity within \(NC^ 1\) (Q2640342) (← links)
- Number of variables is equivalent to space (Q2758055) (← links)
- Extensions of an idea of McNaughton (Q3489464) (← links)
- Finite monoids and the fine structure of <i>NC</i> <sup>1</sup> (Q3820014) (← links)
- (Q3975161) (← links)
- (Q4036704) (← links)
- (Q4281556) (← links)
- Some results on uniform arithmetic circuit complexity (Q4285623) (← links)
- (Q4938621) (← links)
- Lower bounds for modular counting by circuits with modular gates (Q5096324) (← links)
