Theoretical bounds on the complexity of inexact computations
From MaRDI portal
Publication:4109297
DOI10.1109/TIT.1976.1055603zbMath0341.68034MaRDI QIDQ4109297
Publication date: 1976
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10)
Related Items (1)
This page was built for publication: Theoretical bounds on the complexity of inexact computations