An overview of computational complexity
- 1 June 1983
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 26 (6) , 400-408
- https://doi.org/10.1145/358141.358144
Abstract
No abstract availableKeywords
This publication has 51 references indexed in Scilit:
- A universal interconnection pattern for parallel computersJournal of the ACM, 1982
- UltracomputersACM Transactions on Programming Languages and Systems, 1980
- Relations Among Complexity MeasuresJournal of the ACM, 1979
- New directions in cryptographyIEEE Transactions on Information Theory, 1976
- The circuit value problem is log space complete for PACM SIGACT News, 1975
- Factoring polynomials over large finite fieldsMathematics of Computation, 1970
- On the minimum computation time of functionsTransactions of the American Mathematical Society, 1969
- Minimum partition of a matroid into independent subsetsJournal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics, 1965
- On the computational complexity of algorithmsTransactions of the American Mathematical Society, 1965
- Classes of predictably computable functionsTransactions of the American Mathematical Society, 1963