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)
The average time necessary to add numbers by local parallel computation is directly related to the l...
Kolmogorov complexity is a theory based on the premise that the complexity of a binary string can be...
We investigate the number of iterations needed by an addition algorithm due to Burks et al. if the i...
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 ...
Drawing on various notions from theoretical computer science, we present a novel numerical approach,...
Using Kolmogorov-complexity, we obtain the following new lower bounds. For on-line nondeterministic ...
AbstractThe utility of a Kolmogorov complexity method in combinatorial theory is demonstrated by sev...
Symmetry of information states that C(x)+C(y|x)=C(x,y)+O(log(C(x))). In [Chernov, Shen, Vereshchagin...
We present the 2k-ary and the sliding window algorithms for fast exponentiation. We give a precise f...
AbstractThis paper completely characterizes the Θkp levels of the polynomial hierarchy in terms of K...
AbstractWe continue an investigation into resource-bounded Kolmogorov complexity (Allender et al., 2...
Abstract In 1984, Leonid Levin has initiated a theory of average-case complexity. We provide an expo...
The term "complexity" has different meanings in different contexts. Computational complexity measure...
Drawing on various notions from theoretical computer science, we present a novel numerical approach,...
The average time necessary to add numbers by local parallel computation is directly related to the l...
Kolmogorov complexity is a theory based on the premise that the complexity of a binary string can be...
We investigate the number of iterations needed by an addition algorithm due to Burks et al. if the i...
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 ...
Drawing on various notions from theoretical computer science, we present a novel numerical approach,...
Using Kolmogorov-complexity, we obtain the following new lower bounds. For on-line nondeterministic ...
AbstractThe utility of a Kolmogorov complexity method in combinatorial theory is demonstrated by sev...
Symmetry of information states that C(x)+C(y|x)=C(x,y)+O(log(C(x))). In [Chernov, Shen, Vereshchagin...
We present the 2k-ary and the sliding window algorithms for fast exponentiation. We give a precise f...
AbstractThis paper completely characterizes the Θkp levels of the polynomial hierarchy in terms of K...
AbstractWe continue an investigation into resource-bounded Kolmogorov complexity (Allender et al., 2...
Abstract In 1984, Leonid Levin has initiated a theory of average-case complexity. We provide an expo...
The term "complexity" has different meanings in different contexts. Computational complexity measure...
Drawing on various notions from theoretical computer science, we present a novel numerical approach,...
The average time necessary to add numbers by local parallel computation is directly related to the l...
Kolmogorov complexity is a theory based on the premise that the complexity of a binary string can be...
We investigate the number of iterations needed by an addition algorithm due to Burks et al. if the i...
DOI
Add to ORKG