December 1990, Volume 48, Issue 6, pp 1226-1234
Lower bounds of the complexity of symmetric boolean functions of contact-rectifier circuits
- A. A. Razborov
- … show all 1 hide
Purchase on Springer.com
$39.95 / €34.95 / £29.95*
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.
Translated from Matematicheskie Zametki, Vol. 48, No. 6, pp. 79–90, December, 1990.
- P. Pudlak, “The hierarchy of Boolean circuits,” Comput. Art. Intel.,6, No. 5, 449–468 (1987).
- A. A. Markov, “On minimal contact-rectifier bipolar circuits for monotone symmetric functions,” Probl. Kibern., No. 8, 117–121 (1962).
- E. I. Nechiporuk, “On a boolean function,” Dokl. Akad. Nauk SSSR,169, No. 4, 765–766 (1966).
- A. Borodin, D. Dolev, F. E. Fich, and W. Paul, “Bounds for width 2 branching programs,” Proc. 15th ACM STOC (1983), pp. 87–93.
- A. K. Chandra, M. L. Fürst, and R. J. Lipton, “Multiparty protocols,” Proc. 15th ACM STOC (1983), pp. 94–99.
- A. C. Yao, “Lower bounds by probabilistic arguments,” Proc. 24th IEEE FOCS (1983), pp. 420–428.
- P. Pudlak, “A lower bound on complexity of branching programs,” Proc. 11th Symposium on Mathematical Foundations of Computer Science (1984), Lecture Notes in Computer Science (1984), Vol. 176.
- M. Ajtai, L. Babai, P. Hajnal, J. Komlos, P. Pudlak, V. Rodl, E. Szemeredi, and Gy Turan, “Two lower bounds for branching programs,” Proc. 18th ACM STOC (1986), pp. 30–38.
- N. Alon and W. M. Maass, “Ramsey theory and lower bounds for branching programs,” Proc. 27th IEEE FOCS (1986), pp. 410–417.
- L. Babai, P. Pudlak, V. Rodl, and E. Szemeredi, “Lower bounds to the complexity of symmetric Boolean functions,” preprint.
- M. I. Grinchuk, On the Complexity of Realization of Symmetric Boolean Functions by Contact Circuits [in Russian], Dissertation for the Degree of Candidate in Mathematical Physics, Moscow (1989).
- A. A. Razborov, “On the method of approximations,” Proc. 21st ACM STOC (1989), pp. 167–176.
- R. L. Graham, B. L. Rothschild, and J. H. Spencer, Ramsey Theory, New York, Wiley (1980).
- Lower bounds of the complexity of symmetric boolean functions of contact-rectifier circuits
Mathematical notes of the Academy of Sciences of the USSR
Volume 48, Issue 6 , pp 1226-1234
- Cover Date
- Print ISSN
- Online ISSN
- Kluwer Academic Publishers-Plenum Publishers
- Additional Links
- A. A. Razborov (1)
- Author Affiliations
- 1. Steklov Institute of Mathematics, Academy of Sciences of the USSR, USSR