Add to ORKGThis thesis is concerned with analysing the impact of nesting (restricted) control structures in programs, such as primitive recursion or loop statements, on the running time or computational complexity. The method obtained gives insight as to why some nesting of control structures may cause a blow up in computational complexity, while others do not. The method is demonstrated for three types of programming languages..
We present a modular approach to automatic complexity analysis. Based on a novel alternation between...
Complexity theory helps us predict and control resources, usually time and space, consumed by progra...
This paper gives an overview of subrecursive hierarchy theory as it relates to computational complex...
This thesis is concerned with analysing the impact of nesting (restricted) control structures in pro...
AbstractA key problem in implicit computational complexity is to analyse the impact on program run t...
AbstractTwo restricted imperative programming languages are considered: One is a slight modification...
AbstractAn instance of a control structure is a mapping which takes one or more programs into a new ...
We provide a resource-free characterization of register machines that computes their output within p...
Controlling the resource consumption of programs is crucial: besides performance reasons, it has man...
ABSTRACT. The structural complexity of programming languages, and therefore of programs as well, can...
Given a programming language operating on stacks, we introduce a syntactical measure mu such that, a...
AbstractThe complexity of the computation of recursive programs by the combinator reduction machine ...
Colson and Moschovakis results cast doubt on the ability of the primitive recursive model to compute...
A method for measuring the complexity of control structures is presented. It is based on the size of...
We provide machine-independent characterizations of some complexity classes, over an arbitrary struc...
We present a modular approach to automatic complexity analysis. Based on a novel alternation between...
Complexity theory helps us predict and control resources, usually time and space, consumed by progra...
This paper gives an overview of subrecursive hierarchy theory as it relates to computational complex...
This thesis is concerned with analysing the impact of nesting (restricted) control structures in pro...
AbstractA key problem in implicit computational complexity is to analyse the impact on program run t...
AbstractTwo restricted imperative programming languages are considered: One is a slight modification...
AbstractAn instance of a control structure is a mapping which takes one or more programs into a new ...
We provide a resource-free characterization of register machines that computes their output within p...
Controlling the resource consumption of programs is crucial: besides performance reasons, it has man...
ABSTRACT. The structural complexity of programming languages, and therefore of programs as well, can...
Given a programming language operating on stacks, we introduce a syntactical measure mu such that, a...
AbstractThe complexity of the computation of recursive programs by the combinator reduction machine ...
Colson and Moschovakis results cast doubt on the ability of the primitive recursive model to compute...
A method for measuring the complexity of control structures is presented. It is based on the size of...
We provide machine-independent characterizations of some complexity classes, over an arbitrary struc...
We present a modular approach to automatic complexity analysis. Based on a novel alternation between...
Complexity theory helps us predict and control resources, usually time and space, consumed by progra...
This paper gives an overview of subrecursive hierarchy theory as it relates to computational complex...