Complexity of computations
- 1 September 1977
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 20 (9), 625-633
- https://doi.org/10.1145/359810.359816
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- On computing the Discrete Fourier TransformProceedings of the National Academy of Sciences, 1976
- Optimal algorithms for parallel polynomial evaluationJournal of Computer and System Sciences, 1973
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Permuting Information in Idealized Two-Level StoragePublished by Springer Nature ,1972
- Schnelle Multiplikation großer ZahlenComputing, 1971
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- On the Addition of Binary NumbersIEEE Transactions on Computers, 1970
- Gaussian elimination is not optimalNumerische Mathematik, 1969
- A Machine-Independent Theory of the Complexity of Recursive FunctionsJournal of the ACM, 1967
- On the Time Required to Perform AdditionJournal of the ACM, 1965