Space and Time Hierarchies for Classes of Control Structures and Data Structures
Journal of the ACM (JACM)
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Reference machines require non-linear time to maintain disjoint sets
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
On feasible numbers (Preliminary Version)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Efficient reducibility between programming systems (Preliminary Report)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Complexity of implementations on the level of algebraic specifications
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
This paper represents a continuation of work in [LBI] and [LB2] directed toward the development of a unified, relative model for complexity theory. The earlier papers establish a simple, natural and fairly general model, and demonstrated its attractiveness by using it to state and prove a variety of technical results. The present paper uses the same model but deals more specifically with the problems involved in stating complexity bounds in a usable closed form for arbitrary operations on arbitrary data types. Work currently in progress is directed toward similar unified treatment of complexity of data structures.