Straight-line program length as a parameter for complexity analysis
- 31 December 1980
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 21 (3) , 251-280
- https://doi.org/10.1016/0022-0000(80)90024-0
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Aho, A. V. / Hopcroft, J. E. / Ullman, J. D., The Design and Analysis of Computer Algorithms. London‐Amsterdam‐Don Mills‐Sydney. Addison‐Wesley Publ. Comp. 1974 X, 470 S., $ 24,–ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1979
- A difference in expressive power between flowcharts and recursion schemesTheory of Computing Systems, 1978
- Abstract data types and software validationCommunications of the ACM, 1978
- Straight-line program length as a parameter for complexity measuresPublished by Association for Computing Machinery (ACM) ,1978
- Reference machines require non-linear time to maintain disjoint setsPublished by Association for Computing Machinery (ACM) ,1977
- Specification techniques for data abstractionsIEEE Transactions on Software Engineering, 1975
- The Algebraic Invariance of the Word Problem in GroupsPublished by Elsevier ,1973
- COMBINATORIAL GROUP THEORYJournal of the London Mathematical Society, 1968
- Hierarchies of Computable groups and the word problemThe Journal of Symbolic Logic, 1966
- Computable Algebra, General Theory and Theory of Computable FieldsTransactions of the American Mathematical Society, 1960