Tight bounds on expected time to add correctly and add mostly correctly
type: Item
instance of: scholarly article
title: Tight bounds on expected time to add correctly and add mostly correctly
zbMATH Open document ID: 0795.68103
DOI: 10.1016/0020-0190(94)90031-0
author: Mor Harchol
author: Peter S. Gemmell
published in: Information Processing Letters
publication date: 1994-04-04T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W35
Mathematics Subject Classification ID: 94C10
zbMATH DE Number: 540910
zbMATH Keywords: addition
zbMATH Keywords: circuit of AND, OR, and NOT gates
MaRDI profile type: Publication
full work available at URL: 0020-0190(94)90031-0
OpenAlex ID: W1982530285
cites work: Designing programs that check their work
Recommended article: Q3033322
Recommended article: Bounds for parallel addition time of two numbers
Recommended article: Exact complexity bounds for ordinal addition
Recommended article: Q3343443
Recommended article: On approximate majority and probabilistic time
Recommended article: Q5501238
Recommended article: On lower bounds for the time of computation
Recommended article: Q3757904
Recommended article: On the Complexity of Adding Convergence
Recommended article: A tight lower bound for the completion time variance problem
description: scientific article; zbMATH DE number 540910