Addition in \(\log_{2} n+O(1)\) steps on average. A simple analysis

DOI10.1016/S0304-3975(97)00181-3zbMath0897.68056OpenAlexW2084559864MaRDI QIDQ1127333

Bill Gasarch, Richard Beigel, Ming Li, Louxin Zhang

Publication date: 13 August 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(97)00181-3

zbMATH Keywords

Kolmogorov complexityadditionaverage case analysis

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (1)

Average-case analysis via incompressibility

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to Add Fast--on Average
• Some New Results on Average Worst Case Carry

This page was built for publication: Addition in \(\log_{2} n+O(1)\) steps on average. A simple analysis