An overview of computational complexity
- 1 January 2007
- book chapter
- Published by Association for Computing Machinery (ACM)
Abstract
No abstract availableThis publication has 48 references indexed in Scilit:
- The maximum flow problem is log space complete for PTheoretical Computer Science, 1982
- On uniform circuit complexityJournal of Computer and System Sciences, 1981
- The complexity of computing the permanentTheoretical Computer Science, 1979
- Linear programming is log-space hard for PInformation Processing Letters, 1979
- A 222pn upper bound on the complexity of Presburger ArithmeticJournal of Computer and System Sciences, 1978
- Complete problems for deterministic polynomial timeTheoretical Computer Science, 1976
- The network complexity and the Turing machine complexity of finite functionsActa Informatica, 1976
- Die Berechnungskomplexität von elementarsymmetrischen Funktionen und von InterpolationskoeffizientenNumerische Mathematik, 1973
- Schnelle Multiplikation großer ZahlenComputing, 1971
- Gaussian elimination is not optimalNumerische Mathematik, 1969