Time complexity of a Kalman filter
mediumsubjective
Asked in interviews
What is the computational time complexity of one Kalman-filter cycle (predict + update), and which operations dominate it? Express it in terms of the state dimension n and measurement dimension m, and explain what that implies for high-dimensional problems such as full-state SLAM.
Voice input needs Chrome or Edge. On this browser, type your answer — grading is the same.