On the size of binary decision diagrams representing Boolean functions (Q673087): Difference between revisions

@@ Property / author @@
+Yuri Breitbart
@@ Property / author: Yuri Breitbart / rank @@
+Normal rank
@@ Property / author @@
+Harry B. III Hunt
@@ Property / author: Harry B. III Hunt / rank @@
+Normal rank
@@ Property / author @@
+Daniel J. Rosenkrantz
@@ Property / author: Daniel J. Rosenkrantz / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Functional test generation using binary decision diagrams
+Normal rank
@@ Property / cites work @@
+Binary decision tree test functions
@@ Property / cites work: Binary decision tree test functions / rank @@
+Normal rank
@@ Property / cites work @@
+Binary Decision Diagrams
@@ Property / cites work: Binary Decision Diagrams / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound for read-once-only branching programs
+Normal rank
@@ Property / cites work @@
+Bounds for Width Two Branching Programs
@@ Property / cites work: Bounds for Width Two Branching Programs / rank @@
+Normal rank
@@ Property / cites work @@
+Some bounds on the complexity of predicate recognition by finite automata
+Normal rank
@@ Property / cites work @@
+Graph-Based Algorithms for Boolean Function Manipulation
+Normal rank
@@ Property / cites work @@
+Q3694708
@@ Property / cites work: Q3694708 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4160379
@@ Property / cites work: Q4160379 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the optimal variable ordering for binary decision diagrams
+Normal rank
@@ Property / cites work @@
+Branching programs provide lower bounds on the area of multilective deterministic and nondeterministic VLSI circuits
+Normal rank
@@ Property / cites work @@
+Q3821583
@@ Property / cites work: Q3821583 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for depth-restricted branching programs
+Normal rank
@@ Property / cites work @@
+Q3710469
@@ Property / cites work: Q3710469 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5628016
@@ Property / cites work: Q5628016 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3976028
@@ Property / cites work: Q3976028 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial size \(\Omega\)-branching programs and their computational power
+Normal rank
@@ Property / cites work @@
+Q3690219
@@ Property / cites work: Q3690219 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4172915
@@ Property / cites work: Q4172915 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal decision trees and one-time-only branching programs for symmetric Boolean functions
+Normal rank
@@ Property / cites work @@
+Time-space trade-offs for branching programs
@@ Property / cites work: Time-space trade-offs for branching programs / rank @@
+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 / full work available at URL @@
+https://doi.org/10.1016/0304-3975(94)00181-h
+Normal rank
@@ Property / OpenAlex ID @@
+W2054195481
@@ Property / OpenAlex ID: W2054195481 / rank @@
+Normal rank