Graph-theoretic arguments in low-level complexity

This publication has 12 references indexed in Scilit:

• Circuit size is nonlinear in depth
  Theoretical Computer Science, 1976
• Shifting Graphs and Their Applications
  Journal of the ACM, 1976
• Space bounds for a game on graphs
  Published by Association for Computing Machinery (ACM) ,1976
• On time versus space and related problems
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1975
• On sparse graphs with dense long paths
  Computers & Mathematics with Applications, 1975
• The complexity of parallel evaluation of linear recurrence
  Published by Association for Computing Machinery (ACM) ,1975
• On non-linear lower bounds in computational complexity
  Published by Association for Computing Machinery (ACM) ,1975
• Zwei lineare untere Schranken für die Komplexität Boolescher Funktionen
  Computing, 1974
• Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von Interpolationskoeffizienten
  Numerische Mathematik, 1973
• On the number of multiplications necessary to compute certain functions
  Communications on Pure and Applied Mathematics, 1970