Approximating Boolean functions by OBDDs (Q867861): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2006.04.037
@@ Property / DOI: 10.1016/j.dam.2006.04.037 / rank @@
-Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2006.04.037
+Normal rank
@@ Property / OpenAlex ID @@
+W2048763879
@@ Property / OpenAlex ID: W2048763879 / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound for integer multiplication on randomized ordered read-once branching programs.
+Normal rank
@@ Property / cites work @@
+On the Complexity of the Hidden Weighted Bit Function for Various BDD Models
+Normal rank
@@ Property / cites work @@
+On the nonapproximability of Boolean functions by OBDDs and read-\(k\)-times branching programs
+Normal rank
@@ Property / cites work @@
+Read-once projections and formal circuit verification with binary decision diagrams
+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 @@
+Graph-Based Algorithms for Boolean Function Manipulation
+Normal rank
@@ Property / cites work @@
+On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplication
+Normal rank
@@ Property / cites work @@
+A Reliable Randomized Algorithm for the Closest-Pair Problem
+Normal rank
@@ Property / cites work @@
+Q4234109
@@ Property / cites work: Q4234109 / rank @@
+Normal rank
@@ Property / cites work @@
+Communication Complexity
@@ Property / cites work: Communication Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4234058
@@ Property / cites work: Q4234058 / rank @@
+Normal rank
@@ Property / cites work @@
+Time-space tradeoff lower bounds for integer multiplication and graphs of arithmetic functions
+Normal rank
@@ Property / cites work @@
+Q4855565
@@ Property / cites work: Q4855565 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal lower bounds on the depth of polynomial-size threshold circuits for some arithmetic functions
+Normal rank
@@ Property / cites work @@
+Branching Programs and Binary Decision Diagrams
@@ Property / cites work: Branching Programs and Binary Decision Diagrams / rank @@
+Normal rank
@@ Property / cites work @@
+Q2762533
@@ Property / cites work: Q2762533 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2006.04.037
@@ Property / DOI: 10.1016/J.DAM.2006.04.037 / rank @@
+Normal rank