Using amplification to compute majority with small majority gates (Q677991): Difference between revisions

@@ Property / author @@
-Arvind Kumar Gupta
@@ Property / author: Arvind Kumar Gupta / rank @@
-Normal rank
@@ Property / author @@
-Sanjeev Mahajan
@@ Property / author: Sanjeev Mahajan / rank @@
-Normal rank
@@ Property / author @@
+Arvind Kumar Gupta
@@ Property / author: Arvind Kumar Gupta / rank @@
+Normal rank
@@ Property / author @@
+Sanjeev Mahajan
@@ Property / author: Sanjeev Mahajan / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Amplification and percolation (probabilistic Boolean 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 @@
+Method of determining lower bounds for the complexity of \(\Pi\)-circuits
+Normal rank
@@ Property / cites work @@
+Reliable circuits using less reliable relays
@@ Property / cites work: Reliable circuits using less reliable relays / rank @@
+Normal rank
@@ Property / cites work @@
+Short monotone formulae for the majority function
@@ Property / cites work: Short monotone formulae for the majority function / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:677991