A note on a theorem of Barrington, Straubing and Thérien (Q1351160): Difference between revisions

@@ Property / cites work @@
+Q4036704
@@ Property / cites work: Q4036704 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
+Normal rank
@@ Property / cites work @@
+Superlinear lower bounds for bounded-width branching programs
+Normal rank
@@ Property / cites work @@
+Non-uniform automata over groups
@@ Property / cites work: Non-uniform automata over groups / rank @@
+Normal rank
@@ Property / cites work @@
+Finite monoids and the fine structure of             <i>NC</i>             <sup>1</sup>
+Normal rank
@@ Property / cites work @@
+Lower bounds for depth-three circuits with equals and mod-gates
+Normal rank
@@ Property / cites work @@
+Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
+Normal rank