Graph-theoretic arguments in low-level complexity
Author:
- 1 January 1977
- book chapter
- Published by Springer Nature
- p. 162-176
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Circuit size is nonlinear in depthTheoretical Computer Science, 1976
- Shifting Graphs and Their ApplicationsJournal of the ACM, 1976
- Space bounds for a game on graphs1976
- On time versus space and related problems1975
- On sparse graphs with dense long pathsComputers & Mathematics with Applications, 1975
- The complexity of parallel evaluation of linear recurrence1975
- On non-linear lower bounds in computational complexity1975
- Zwei lineare untere Schranken für die Komplexität Boolescher FunktionenComputing, 1974
- Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von InterpolationskoeffizientenNumerische Mathematik, 1973
- On the number of multiplications necessary to compute certain functionsCommunications on Pure and Applied Mathematics, 1970