Tight bounds on expected time to add correctly and add mostly correctly

DOI10.1016/0020-0190(94)90031-0zbMath0795.68103OpenAlexW1982530285MaRDI QIDQ1318774

Mor Harchol, Peter S. Gemmell

Publication date: 4 April 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)90031-0

zbMATH Keywords

additioncircuit of AND, OR, and NOT gates

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Cites Work

• Designing programs that check their work

This page was built for publication: Tight bounds on expected time to add correctly and add mostly correctly