The optimal read-once branching program complexity for the direct storage access function (Q963361): Difference between revisions

@@ Property / DOI @@
-.1016/j.ipl.2007.11.009
@@ Property / DOI: 10.1016/j.ipl.2007.11.009 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2007.11.009
+Normal rank
@@ Property / OpenAlex ID @@
+W2080585858
@@ Property / OpenAlex ID: W2080585858 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact OBDD bounds for some fundamental functions
@@ Property / cites work: Exact OBDD bounds for some fundamental functions / rank @@
+Normal rank
@@ Property / cites work @@
+A read-once branching program lower bound of Ω(2             <sup>n/4</sup>             ) for integer multiplication using universal hashing
+Normal rank
@@ Property / cites work @@
+Optimal decision trees and one-time-only branching programs for symmetric Boolean functions
+Normal rank
@@ Property / cites work @@
+Q3762226
@@ Property / cites work: Q3762226 / rank @@
+Normal rank
@@ Property / cites work @@
+Branching Programs and Binary Decision Diagrams
@@ Property / cites work: Branching Programs and Binary Decision Diagrams / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.IPL.2007.11.009
@@ Property / DOI: 10.1016/J.IPL.2007.11.009 / rank @@
+Normal rank