Using amplification to compute majority with small majority gates

Computational Complexity

Volumn 6, Issue 1, 1996, Pages 46-63

  Gupta, Arvind ^a   Mahajan, Sanjeev ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Amplification; Formula; Majority; Probabilistic construction

Indexed keywords

EID: 0039648384     PISSN: 10163328     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF01202041     Document Type: Article

References (9)

1. R. BOPPANA, Amplification of probabilistic boolean formulas. In Advances in Computing Research, vol. 5, ed. S. MACALI AND F. PREPARATA, Jai Press Inc., 1989, 27-45.
2. R. BOPPANA, 1991. Private communication.
3. M. DUBINER AND U. ZWICK, Amplification and percolation. In Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, 1992, 258-267.
4. J. FRIEDMAN, Constructing o(nlogn) size monotnoe formulae for the kth threshold function of n boolean variables. SIAM Journal on Computing 15(3) (1986), 641-654.
5. V. KHRAPCHENKO, A method of determining lower bounds for the complexity of TT-schemes. Math. Notes of the Academy of Sciences of the USSR (1972), 474-479.
6. E. MOORE AND C. SHANNON, Reliable circuits using less reliable relays. Journal of the Franklin Institute 262 (1956), 191-208 and 281-297.
7. M. PATERSON, N. PIPPENGER, AND U. ZWICK, Faster circuits and shorter formulae for multiple addition, multiplication and symmetric Boolean functions. In Proceedings of the 31st Annual IEEE Symposium on the Foundations of Computer Science, 1990, 642-650.
8. J. RADHAKRISHNAN, Better bounds for threshold formulas. In Proceedings of the 32nd Annual IEEE Symposium on the Foundations of Computer Science, 1991, 314-323.
9. L. VALIANT, Short monotone formulae for the majority function. Journal of Algorithms 5 (1984), 363-366.