AbstractWe demonstrate the use of Kolmogorov complexity in average case analysis of algorithms through a classical example: adding two n-bit numbers in [log2 n] + 2 steps on average. We simplify the analysis of Burks et al. (1961) and (in more complete forms) Briley (1973) and Schay (1995)
International audienceWe describe a general framework for realistic analysis of sorting algorithms, ...
The airn of this talk is to give an introduction to the notion of Levin's average case complexity a...
The notion of algorithmic complexity (also sometimes called \algorithmic en-tropy") appeared in...
AbstractWe demonstrate the use of Kolmogorov complexity in average case analysis of algorithms throu...
This expository paper demonstrates how to use Kolmogorov complexity to do the average-case analysis ...
AbstractMany probabilistic properties of elementary discrete combinatorial structures of interest fo...
Abstract In 1984, Leonid Levin has initiated a theory of average-case complexity. We provide an expo...
Drawing on various notions from theoretical computer science, we present a novel numerical approach,...
AbstractOne knows from the Algorithmic Complexity Theory11This theory is also called the Kolmogorov ...
Drawing on various notions from theoretical computer science, we present a novel numerical approach,...
This report is part of a projected series whose aim is to present in a synthetic way the major metho...
Brbauwens at gmail dot com Symmetry of information states that C(x) + C(y|x) = C(x, y) + O(logC(x))...
The question of natural measures of complexity for objects other than strings and sequences, in part...
F.S-T. and H.Z. contributed equally. Drawing on various notions from theoretical computer science, w...
AbstractThe utility of a Kolmogorov complexity method in combinatorial theory is demonstrated by sev...
International audienceWe describe a general framework for realistic analysis of sorting algorithms, ...
The airn of this talk is to give an introduction to the notion of Levin's average case complexity a...
The notion of algorithmic complexity (also sometimes called \algorithmic en-tropy") appeared in...
AbstractWe demonstrate the use of Kolmogorov complexity in average case analysis of algorithms throu...
This expository paper demonstrates how to use Kolmogorov complexity to do the average-case analysis ...
AbstractMany probabilistic properties of elementary discrete combinatorial structures of interest fo...
Abstract In 1984, Leonid Levin has initiated a theory of average-case complexity. We provide an expo...
Drawing on various notions from theoretical computer science, we present a novel numerical approach,...
AbstractOne knows from the Algorithmic Complexity Theory11This theory is also called the Kolmogorov ...
Drawing on various notions from theoretical computer science, we present a novel numerical approach,...
This report is part of a projected series whose aim is to present in a synthetic way the major metho...
Brbauwens at gmail dot com Symmetry of information states that C(x) + C(y|x) = C(x, y) + O(logC(x))...
The question of natural measures of complexity for objects other than strings and sequences, in part...
F.S-T. and H.Z. contributed equally. Drawing on various notions from theoretical computer science, w...
AbstractThe utility of a Kolmogorov complexity method in combinatorial theory is demonstrated by sev...
International audienceWe describe a general framework for realistic analysis of sorting algorithms, ...
The airn of this talk is to give an introduction to the notion of Levin's average case complexity a...
The notion of algorithmic complexity (also sometimes called \algorithmic en-tropy") appeared in...
DOI
Add to ORKG