AbstractA definition is proposed for a size measure to be used as a parameter for algorithm analysis in any algebra. The parameter is simply the straight-line program length in the associated free algebra. This parameter generalizes the usual measures in basic arithmetic and string algebras, as well as some apparently different measures used for data structure algorithms. Another use is illustrated with an introduction to complexity-bounded group theory
Data manipulation, or algorithmic complexity, is not taken into account adequately in any of the mos...
In this paper, we apply different software complexity measures to a set of shortest-path algorithms....
Minimal encoding length (Kolmogorov complexity) is a measure of information content (randomness) the...
A definition is proposed for a size measure to be used as a parameter for algorithm analysis in any ...
The present paper is a companion to [2], in which a general definition of straight-line program leng...
Abstract. We present a modular approach to automatic complexity analysis. Based on a novel alternati...
Abstract. We present a modular approach to automatic complexity analysis. Based on a novel alternati...
This work is a study of an information theoretic model which is used to develop a complexity measure...
ge like Pascal, C, Lisp, or whatever. We will restrict attention to programs that have no input, so ...
Abstract. A simple algebraic model is proposed for measuring the relative complexity of programming ...
We investigate the properties of a divide-and-conquer Block Decomposition Method (BDM), which extend...
AbstractWe investigate the complexity of derivations from logic programs, and find it closely relate...
Graduation date: 1980Most measures of program complexity gauge either textual or\ud control flow att...
Stochastic complexity of a data set is defined as the shortest possible code length for the data ob...
This paper describes an inter-procedural technique for computing symbolic bounds on the number of st...
Data manipulation, or algorithmic complexity, is not taken into account adequately in any of the mos...
In this paper, we apply different software complexity measures to a set of shortest-path algorithms....
Minimal encoding length (Kolmogorov complexity) is a measure of information content (randomness) the...
A definition is proposed for a size measure to be used as a parameter for algorithm analysis in any ...
The present paper is a companion to [2], in which a general definition of straight-line program leng...
Abstract. We present a modular approach to automatic complexity analysis. Based on a novel alternati...
Abstract. We present a modular approach to automatic complexity analysis. Based on a novel alternati...
This work is a study of an information theoretic model which is used to develop a complexity measure...
ge like Pascal, C, Lisp, or whatever. We will restrict attention to programs that have no input, so ...
Abstract. A simple algebraic model is proposed for measuring the relative complexity of programming ...
We investigate the properties of a divide-and-conquer Block Decomposition Method (BDM), which extend...
AbstractWe investigate the complexity of derivations from logic programs, and find it closely relate...
Graduation date: 1980Most measures of program complexity gauge either textual or\ud control flow att...
Stochastic complexity of a data set is defined as the shortest possible code length for the data ob...
This paper describes an inter-procedural technique for computing symbolic bounds on the number of st...
Data manipulation, or algorithmic complexity, is not taken into account adequately in any of the mos...
In this paper, we apply different software complexity measures to a set of shortest-path algorithms....
Minimal encoding length (Kolmogorov complexity) is a measure of information content (randomness) the...
DOI
Add to ORKG