On the multiplicative complexity of Boolean functions over the basis (\(\land,\oplus,1)\). (Q1978699): Difference between revisions

@@ Property / Wikidata QID @@
+Q62472235
@@ Property / Wikidata QID: Q62472235 / rank @@
+Normal rank
@@ Property / cites work @@
+Short Discreet Proofs
@@ Property / cites work: Short Discreet Proofs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4331740
@@ Property / cites work: Q4331740 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3994882
@@ Property / cites work: Q3994882 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4320535
@@ Property / cites work: Q4320535 / rank @@
+Normal rank
@@ Property / cites work @@
+The multiplicative complexity of quadratic boolean forms
+Normal rank
@@ Property / cites work @@
+Bounds to Complexities of Networks for Sorting and for Switching
+Normal rank
@@ Property / cites work @@
+Q3206314
@@ Property / cites work: Q3206314 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4138138
@@ Property / cites work: Q4138138 / rank @@
+Normal rank
@@ Property / cites work @@
+On the combinational complexity of certain symmetric Boolean functions
+Normal rank
@@ Property / cites work @@
+Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
+Normal rank
@@ Property / cites work @@
+Q3762226
@@ Property / cites work: Q3762226 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0304-3975(99)00182-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2091423939
@@ Property / OpenAlex ID: W2091423939 / rank @@
+Normal rank