Which formulae shrink under random restrictions?

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2001, Pages 702-708

  Chockler, Hana ^a   Zwick, Uri ^b  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Algorithms; Theory; Verification

Indexed keywords

EID: 0039034000     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. And87a A.E. Andreev. A method for obtaining efficient lower bounds for monotone complexity. Algebra and Logica, 26:1-18, 1987.
2. And87b A.E. Andreev. On a method for obtaining more than guadratic effective lower bounds for the complexity of a-schemes. Vestnik Moskov. Univ. Mat., 42, 1987. (In Russian.) English translation in Moscow Univ. Math. Bull. 42:63-66, 1987.
3. GM97 Arvind Gupta, Sanjeev Mahajan, Using amplification to compute majority with small majority gates, Computational Complexity, v.6 n.1, p.46-63, 1996/1997[doi〉10.1007/BF01202041]
4. Hâs98 Johan HÅ stad, The Shrinkage Exponent of de Morgan Formulas is 2, SIAM Journal on Computing, v.27 n.1, p.48-64, Feb. 1998 [doi〉10.1137/S0097539794261556]
5. Kva96 H. Kvartin. Formulae with 3-bit majority gates. Master's thesis, Department of Computer Science, Tel Aviv University, 1996.
6. NI93 N. Nisan and R. Impagliazzo. The effect of random restrictions on formulae size. Random Structures Algorithms, 4:121-133, 1993.
7. Pos41 E.L. Post. The two-valued iterative systems of mathematical logic. Annals of Math. Studies, 5, 1941. Princeton University Press, N.J.
8. PZ93a Michael Paterson, Uri Zwick, Shallow circuits and concise formulae for multiple addition and multiplication, Computational Complexity, v.3 n.3, p.262-291, July 1993 [doi〉10.1007/BF01271371]
9. PZ93b M. Paterson and U. Zwick. Shrinkage of de Morgan formulae under restriction. Random Structures Algorithms, 4:135-150, 1993.
10. Rok70 M.M. Rokhlina. On formulae for improving reliability. Problemy Kibernetiki, 23:295-301, 1970. (In Russian.).
11. Sub61 B.A. Subbotovskaya. Realizations of linear functions by formulas using +, *,-. Doklady Akademii Nauk SSSR, 136:553-555, 1961. (In Russian.) English translation in SovietMathematics Doklady, 2:110- 112, 1961.
12. Val84 L.G. Valiant. Short monotone formulae for the majority function. Journal of Algorithms, 5:363-366, 1984.