COMPUTATIONAL COMPLEXITY: ALGORITHMS WITH FEWEST OPERATIONS

DOI10.1111/J.1749-6632.1979.TB14107.XMaRDI QIDQ3854628zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3854628)