Add to ORKGThe study of Computational Complexity began with the investigation of Turing machine computations with limits on the amounts of tape or time which could be used. Later a set of general axioms for measures of computation was presented and this instigated much study of the properties of these general measures. Many interesting results were shown, but the general axioms allowed measures with undesirable properties and several attempts have been made to tighten up the axioms so that only desirable measures will be defined
1 Introduction Computational complexity theory studies the quantitative laws which govern computing....
Estimating the computational complexity of discrete problems constitutes one of the central and clas...
In 1930, Gödel [7] presented in Königsberg his famous Incompleteness Theorem, stat-ing that some tru...
To develop an abstract theory which deals with the quantitative aspects of computing we need a deepe...
The thesis aims to analyze some fundamental theoretical elements of Computability Theory and Computa...
The purpose of this paper is to outline the theory of computational complexity which has emerged as ...
AbstractThere is a dependency between computability of algorithmic complexity and decidability of di...
The most celebrated open problem in theoretical computer science is, undoubtedly, the problem of whe...
Investigating Logics for Feasible Computation The most celebrated open problem in theoretical comput...
During the last four years research on the lower level computational complexity has yielded a rich s...
A weakening of Blum's Axioms for abstract computational complexity is introduced in order to take in...
This volume presents four machine-independent theories of computational complexity, which have been ...
Introduction Computational complexity is the study of the di#culty of solving computational problem...
The importance of algorithms is now recognized in all mathematical sciences, thanks to the developm...
This paper approaches computational complexity as the determination of the intrinsic difficulty of m...
1 Introduction Computational complexity theory studies the quantitative laws which govern computing....
Estimating the computational complexity of discrete problems constitutes one of the central and clas...
In 1930, Gödel [7] presented in Königsberg his famous Incompleteness Theorem, stat-ing that some tru...
To develop an abstract theory which deals with the quantitative aspects of computing we need a deepe...
The thesis aims to analyze some fundamental theoretical elements of Computability Theory and Computa...
The purpose of this paper is to outline the theory of computational complexity which has emerged as ...
AbstractThere is a dependency between computability of algorithmic complexity and decidability of di...
The most celebrated open problem in theoretical computer science is, undoubtedly, the problem of whe...
Investigating Logics for Feasible Computation The most celebrated open problem in theoretical comput...
During the last four years research on the lower level computational complexity has yielded a rich s...
A weakening of Blum's Axioms for abstract computational complexity is introduced in order to take in...
This volume presents four machine-independent theories of computational complexity, which have been ...
Introduction Computational complexity is the study of the di#culty of solving computational problem...
The importance of algorithms is now recognized in all mathematical sciences, thanks to the developm...
This paper approaches computational complexity as the determination of the intrinsic difficulty of m...
1 Introduction Computational complexity theory studies the quantitative laws which govern computing....
Estimating the computational complexity of discrete problems constitutes one of the central and clas...
In 1930, Gödel [7] presented in Königsberg his famous Incompleteness Theorem, stat-ing that some tru...