COMPUTATIONAL COMPLEXITY: ALGORITHMS WITH FEWEST OPERATIONS

DOI10.1111/J.1749-6632.1979.TB14107.XzbMath0421.68049OpenAlexW2046105512MaRDI QIDQ3854628

Julian Laderman

Publication date: 1979

Published in: Annals of the New York Academy of Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1749-6632.1979.tb14107.x

zbMATH Keywords

minimizing arithmetic operations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (1)

An implementation method for the discrete Kalman filter with applications to large-scale systems

This page was built for publication: COMPUTATIONAL COMPLEXITY: ALGORITHMS WITH FEWEST OPERATIONS