On oblivious branching programs of linear length (Q804285): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0890-5401(91)90039-5
+Normal rank
@@ Property / OpenAlex ID @@
+W2054843454
@@ Property / OpenAlex ID: W2054843454 / rank @@
+Normal rank
@@ Property / cites work @@
+A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation
+Normal rank
@@ Property / cites work @@
+Q3694708
@@ Property / cites work: Q3694708 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3821583
@@ Property / cites work: Q3821583 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for depth-restricted branching programs
+Normal rank
@@ Property / cites work @@
+Lower bounds on the complexity of real-time branching programs
+Normal rank
@@ Property / cites work @@
+Word Problems Solvable in Logspace
@@ Property / cites work: Word Problems Solvable in Logspace / rank @@
+Normal rank
@@ Property / cites work @@
+Das Identitätsproblem für Gruppen mit einer definierenden Relation
+Normal rank
@@ Property / cites work @@
+Q3779737
@@ Property / cites work: Q3779737 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3804193
@@ Property / cites work: Q3804193 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5545524
@@ Property / cites work: Q5545524 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of branching programs and decision trees for clique functions
+Normal rank
@@ Property / cites work @@
+Relationships between nondeterministic and deterministic tape complexities
+Normal rank
@@ Property / cites work @@
+Q3347300
@@ Property / cites work: Q3347300 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:804285