Construction of universal enumerators and formulas for threshold functions (Q1121855): Difference between revisions

@@ Property / cites work @@
+Q3235794
@@ Property / cites work: Q3235794 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5606602
@@ Property / cites work: Q5606602 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5547602
@@ Property / cites work: Q5547602 / rank @@
+Normal rank
@@ Property / cites work @@
+An explicit construction of short monotone formulae for the monotone symmetric functions
+Normal rank
@@ Property / cites work @@
+Constructing $O(n\log n)$ Size Monotone Formulae for the <i>k</i>th Threshold Function of <i>n</i> Boolean Variables
+Normal rank
@@ Property / cites work @@
+Bounded-depth, polynomial-size circuits for symmetric functions
+Normal rank
@@ Property / cites work @@
+The covering problem of complete uniform hypergraphs
+Normal rank
@@ Property / cites work @@
+Q4172915
@@ Property / cites work: Q4172915 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3762226
@@ Property / cites work: Q3762226 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Size of Separating Systems and Families of Perfect Hash Functions
+Normal rank
@@ Property / cites work @@
+Should Tables Be Sorted?
@@ Property / cites work: Should Tables Be Sorted? / rank @@
+Normal rank
@@ Property / cites work @@
+Q4063339
@@ Property / cites work: Q4063339 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal hashing
@@ Property / cites work: Optimal hashing / rank @@
+Normal rank