On the size complexity of monotone formulas

  • Marc Snir
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 85)


"Monotone" formulas, i.e. formulas using positive constants, additions and multiplications are investigated. Lower bounds on the size of monotone formulas representing specific polynomials (permanent, matrix multiplication, symmetric functions) are achieved, using a general, dynamic programming approach. These bounds are tight for the cases investigated. Some generalizations are suggested.


Matrix Multiplication Regular Expression Growth Function Threshold Function Monotone Formula 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AHU]
    A.V. Aho, J.E. Hopcroft and J.D. Ullman. The design and analysis of computer algorithms. Addison-Wesley, 1974.Google Scholar
  2. [EhZ]
    A. Ehrenfeucht and P. Zeiger. Complexity measures for regular expressions. Proc. 6th ACM Symposium on Theory of Computing (1974) 75–79.Google Scholar
  3. [JeS]
    M. Jerrum and M. Snir. Some exact complexity results for straight line computations over semirings. University of Edinburgh Technical Report CSR-58-80 (1980).Google Scholar
  4. [Mi]
    W. Miller. Computational complexity and numerical stability. SIAM J. Computing, 4 (1975) 97–107.Google Scholar
  5. [Ry]
    H.J. Ryser. Combinatorial Mathematics. The Carus Mathematical Monographs 14, 1963.Google Scholar
  6. [Sc]
    C.P. Schnorr. A lower bound on the number of additions in monotone computations. Theoretical Computer Science, 2 (1976) 305–315.Google Scholar
  7. [ShS]
    E. Shamir and M. Snir. On the depth complexity of formulas. Mathematical System Theory (to appear).Google Scholar
  8. [Va1]
    L.G. Valiant. Negation can be exponentially powerfu. Proc. 11th ACM Symposium on Theory of Computing (1979) 189–196.Google Scholar
  9. [Va2]
    L.G. Valiant. The complexity of computing the permanent. Theoretical Computer Science (to appear).Google Scholar
  10. [Va3]
    L.G. Valiant. Completeness classes in algebra. Proc. 11th ACM Symposium on Theory of Computing (1979) 249–261.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1980

Authors and Affiliations

  • Marc Snir
    • 1
  1. 1.Computer Science DepartmentEdinburgh UniversityEdinburghScotland

Personalised recommendations