An impossibility gap between width-4 and width-5 permutation branching programs (Q1041742): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2005.01.012
@@ Property / DOI: 10.1016/j.ipl.2005.01.012 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2005.01.012
+Normal rank
@@ Property / OpenAlex ID @@
+W2090852992
@@ Property / OpenAlex ID: W2090852992 / 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 @@
+Finite soluble groups
@@ Property / cites work: Finite soluble groups / rank @@
+Normal rank
@@ Property / cites work @@
+Q5628016
@@ Property / cites work: Q5628016 / rank @@
+Normal rank
@@ Property / cites work @@
+A Property of Finite Simple Non-Abelian Groups
@@ Property / cites work: A Property of Finite Simple Non-Abelian Groups / rank @@
+Normal rank
@@ Property / cites work @@
+Q3690219
@@ Property / cites work: Q3690219 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2005.01.012
@@ Property / DOI: 10.1016/J.IPL.2005.01.012 / rank @@
+Normal rank