Efficient data structures for Boolean functions (Q1344625): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+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 @@
+Equivalence of free Boolean graphs can be decided probabilistically in polynomial time
+Normal rank
@@ Property / cites work @@
+On the size of binary decision diagrams representing Boolean functions
+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 @@
+Symbolic model checking: \(10^{20}\) states and beyond
+Normal rank
@@ Property / cites work @@
+The graph of multiplication is equivalent to counting
+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 @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4281560
@@ Property / cites work: Q4281560 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on the complexity of real-time branching programs
+Normal rank
@@ Property / cites work @@
+On the OBDD-representation of general Boolean functions
+Normal rank
@@ Property / cites work @@
+A method for obtaining digital signatures and public-key cryptosystems
+Normal rank
@@ Property / cites work @@
+Reduction of OBDDs in linear time
@@ Property / cites work: Reduction of OBDDs in linear time / rank @@
+Normal rank
@@ Property / cites work @@
+Graph driven BDDs -- a new data structure for Boolean functions
+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 @@
+On the complexity of branching programs and decision trees for clique functions
+Normal rank
@@ Property / cites work @@
+The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1344625