A lower bound on branching programs reading some bits twice (Q1392030): Difference between revisions

@@ Property / cites work @@
+Q3682518
@@ Property / cites work: Q3682518 / rank @@
+Normal rank
@@ Property / cites work @@
+On lower bounds for read-\(k\)-times branching programs
+Normal rank
@@ Property / cites work @@
+Q3702513
@@ Property / cites work: Q3702513 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on read-$k$ times branching programs
@@ Property / cites work: A note on read-$k$ times branching programs / rank @@
+Normal rank
@@ Property / cites work @@
+Neither reading few bits twice nor reading illegally helps much
+Normal rank
@@ Property / cites work @@
+Q3783566
@@ Property / cites work: Q3783566 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3364203
@@ Property / cites work: Q3364203 / rank @@
+Normal rank
@@ Property / cites work @@
+New lower bounds and hierarchy results for restricted branching programs
+Normal rank
@@ Property / cites work @@
+On the complexity of branching programs and decision trees for clique functions
+Normal rank
@@ Property / cites work @@
+Efficient data structures for Boolean functions
@@ Property / cites work: Efficient data structures for Boolean functions / rank @@
+Normal rank
@@ Property / cites work @@
+Q3347300
@@ Property / cites work: Q3347300 / rank @@
+Normal rank
@@ Property / cites work @@
+An exponential lower bound for real-time branching programs
+Normal rank
@@ Property / cites work @@
+A superpolynomial lower bound for (1,+k(n))-branching programs
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0304-3975(96)00183-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2042406244
@@ Property / OpenAlex ID: W2042406244 / rank @@
+Normal rank