AI Chat AI Image Generator AI Video Text to Speech

A note on the complexity of addition

06/14/2023

∙

by Emil Jeřábek, et al.

∙

∙

We show that the sum of a sequence of integers can be computed in linear time on a Turing machine. In particular, the most obvious algorithm for this problem, which appears to require quadratic time due to carry propagation, actually runs in linear time by amortized analysis.

page 1

page 2

page 3

page 4

research

∙ 03/12/2018

Linear-Time In-Place DFS and BFS in the Restore Model

We present an in-place depth first search (DFS) and an in-place breadth ...

0 Frank Kammer, et al. ∙

research

∙ 07/01/2020

A Typo in the Paterson-Wegman-de Champeaux algorithm

We investigate the Paterson-Wegman-de Champeaux linear-time unification ...

0 Valeriu Motroi, et al. ∙

research

∙ 11/17/2021

Addition Machines, Automatic Functions and Open Problems of Floyd and Knuth

Floyd and Knuth investigated in 1990 register machines which can add, su...

0 Sanjay Jain, et al. ∙

research

∙ 07/22/2019

The k-Dimensional Weisfeiler-Leman Algorithm

In this note, we provide details of the k-dimensional Weisfeiler-Leman A...

0 Neil Immerman, et al. ∙

research

∙ 07/14/2023

Computing Zigzag Vineyard Efficiently Including Expansions and Contractions

Vines and vineyard connecting a stack of persistence diagrams have been ...

0 Tamal K. Dey, et al. ∙

research

∙ 04/12/2016

An incremental linear-time learning algorithm for the Optimum-Path Forest classifier

We present a classification method with incremental capabilities based o...

0 Moacir Ponti, et al. ∙

research

∙ 06/15/2023

Easier Estimation of Extremes under Randomized Response

In this brief note, we consider estimation of the bitwise combination x_...

0 Jonathan Hehir, et al. ∙