AND–Decomposition of Boolean Polynomials with Prescribed Shared Variables (Q2795943): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-29221-2_14
+Normal rank
@@ Property / OpenAlex ID @@
+W2400529989
@@ Property / OpenAlex ID: W2400529989 / rank @@
+Normal rank
@@ Property / cites work @@
+Exploiting functional properties of Boolean functions for optimal multi-level design by bi-decomposition
+Normal rank
@@ Property / cites work @@
+The complexity of modular decomposition of Boolean functions
+Normal rank
@@ Property / cites work @@
+Q3081619
@@ Property / cites work: Q3081619 / rank @@
+Normal rank
@@ Property / cites work @@
+On Tractability of Disjoint AND-Decomposition of Boolean Formulas
+Normal rank
@@ Property / cites work @@
+Algorithmic issues of AND-decomposition of Boolean formulas
+Normal rank
@@ Property / cites work @@
+On the Relation between Polynomial Identity Testing and Finding Variable Disjoint Factors
+Normal rank
@@ Property / cites work @@
+Modern Computer Algebra
@@ Property / cites work: Modern Computer Algebra / rank @@
+Normal rank
@@ Property / cites work @@
+Q2882946
@@ Property / cites work: Q2882946 / rank @@
+Normal rank
@@ Property / cites work @@
+Equivalence of polynomial identity testing and polynomial factorization
+Normal rank