Neither reading few bits twice nor reading illegally helps much (Q1130185): Difference between revisions

@@ Property / cites work @@
+A lower bound for read-once-only branching programs
+Normal rank
@@ Property / cites work @@
+On lower bounds for read-\(k\)-times branching programs
+Normal rank
@@ Property / cites work @@
+Q3694708
@@ Property / cites work: Q3694708 / rank @@
+Normal rank
@@ Property / cites work @@
+Entropy of contact circuits and lower bounds on their complexity
+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 @@
+Q3821583
@@ Property / cites work: Q3821583 / rank @@
+Normal rank
@@ Property / cites work @@
+Separating the eraser Turing machine classes \(L_ e\), \(NL_ e\), \(co- NL_ e\) and \(P_ e\)
+Normal rank
@@ Property / cites work @@
+Q4146667
@@ Property / cites work: Q4146667 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5545524
@@ Property / cites work: Q5545524 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3364203
@@ Property / cites work: Q3364203 / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound on branching programs reading some bits twice
+Normal rank
@@ Property / cites work @@
+New lower bounds and hierarchy results for restricted branching programs
+Normal rank
@@ Property / cites work @@
+Q3762226
@@ Property / cites work: Q3762226 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of branching programs and decision trees for clique functions
+Normal rank
@@ Property / cites work @@
+Q3347300
@@ Property / cites work: Q3347300 / rank @@
+Normal rank
@@ Property / cites work @@
+A superpolynomial lower bound for (1,+k(n))-branching programs
+Normal rank