The Complexity of Control Structures and Data Structures.
Abstract
The running time or computational complexity of a sequential process is usually determined by summing weights attached to the basic operations from which the process is derived. In practice, however, the complexity is often limited by how efficiently it can access its data structures and how efficiently it can control program flow. Furthermore, it has been extensively argued that certain limitations on the process sequencing mechanisms available to the programmer result in more 'efficient' representations for the underlying processes. In this paper the authors examine these issues in an attempt to assess the 'power' of various data and control structures.
Document Details
- Document Type
- Technical Report
- Publication Date
- Feb 01, 1975
- Accession Number
- ADA015582
Entities
People
- R. A. Demillo
- R. Lipton
- S. C. Eisenstat
Organizations
- University of Wisconsin–Milwaukee