Decomposition representations of logical equations in problems of inversion of discrete functions (Q404200): Difference between revisions

@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+A machine program for theorem-proving
@@ Property / cites work: A machine program for theorem-proving / rank @@
+Normal rank
@@ Property / cites work @@
+BerkMin: A fast and robust SAT-solver
@@ Property / cites work: BerkMin: A fast and robust SAT-solver / rank @@
+Normal rank
@@ Property / cites work @@
+Q4388806
@@ Property / cites work: Q4388806 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Based Algorithms for Boolean Function Manipulation
+Normal rank
@@ Property / cites work @@
+Classifying the computational complexity of problems
+Normal rank
@@ Property / cites work @@
+Resolution and binary decision diagrams cannot simulate each other polynomially
+Normal rank
@@ Property / cites work @@
+Q4692286
@@ Property / cites work: Q4692286 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank