Upper bounds for the formula size of symmetric Boolean functions (Q465106): Difference between revisions

@@ Property / cites work @@
+Q4692286
@@ Property / cites work: Q4692286 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3994882
@@ Property / cites work: Q3994882 / rank @@
+Normal rank
@@ Property / cites work @@
+Boolean function complexity. Advances and frontiers.
+Normal rank
@@ Property / cites work @@
+Q4528867
@@ Property / cites work: Q4528867 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5629239
@@ Property / cites work: Q5629239 / rank @@
+Normal rank
@@ Property / cites work @@
+$\Omega (n\log n)$ Lower Bounds on Length of Boolean Formulas
+Normal rank
@@ Property / cites work @@
+Shallow circuits and concise formulae for multiple addition and multiplication
+Normal rank
@@ Property / cites work @@
+The complexity of the realization of symmetrical functions by formulae
+Normal rank
@@ Property / cites work @@
+Q4036708
@@ Property / cites work: Q4036708 / rank @@
+Normal rank
@@ Property / cites work @@
+On the combinational complexity of certain symmetric Boolean functions
+Normal rank
@@ Property / cites work @@
+New upper bounds on the Boolean circuit complexity of symmetric functions
+Normal rank
@@ Property / cites work @@
+Q5670543
@@ Property / cites work: Q5670543 / rank @@
+Normal rank