A very simple function that requires exponential size read-once branching programs. (Q2583538): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+On lower bounds for read-\(k\)-times branching programs
+Normal rank
@@ Property / cites work @@
+A simple function that requires exponential size read-once branching programs
+Normal rank
@@ Property / cites work @@
+Efficient Boolean manipulation with OBDD's can be extended to FBDD's
+Normal rank
@@ Property / cites work @@
+Entropy of contact circuits and lower bounds on their complexity
+Normal rank
@@ Property / cites work @@
+Q4699308
@@ Property / cites work: Q4699308 / rank @@
+Normal rank
@@ Property / cites work @@
+On a problem of K. Zarankiewicz
@@ Property / cites work: On a problem of K. Zarankiewicz / 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 @@
+Q3783566
@@ Property / cites work: Q3783566 / rank @@
+Normal rank
@@ Property / cites work @@
+Some remarks on Boolean sums
@@ Property / cites work: Some remarks on Boolean sums / rank @@
+Normal rank
@@ Property / cites work @@
+Q5656695
@@ Property / cites work: Q5656695 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234058
@@ Property / cites work: Q4234058 / rank @@
+Normal rank
@@ Property / cites work @@
+A read-once lower bound and a \((1,+k)\)-hierarchy for branching programs
+Normal rank
@@ Property / cites work @@
+Graph driven BDDs -- a new data structure for Boolean functions
+Normal rank
@@ Property / cites work @@
+Q4287364
@@ Property / cites work: Q4287364 / rank @@
+Normal rank
@@ Property / cites work @@
+A new lower bound on the monotone network complexity of Boolean sums
+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 / full work available at URL @@
+https://doi.org/10.1016/s0020-0190(98)00042-8
+Normal rank
@@ Property / OpenAlex ID @@
+W2070290122
@@ Property / OpenAlex ID: W2070290122 / rank @@
+Normal rank