Damiano Brigo; Bernard Hanzon and François LeGland (Filtering Problem (Stochastic Processes) Filtering Problem (Stochastic Processes))

From Algorithm Wiki
Revision as of 11:53, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n^{2.45} logn)$ == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1998 == Reference == https://ieeexplore.ieee.org/abstract/document/661075")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Time Complexity

$O(n^{2.45} logn)$

Space Complexity

words

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word/Real RAM

Year

1998

Reference

https://ieeexplore.ieee.org/abstract/document/661075

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Damiano_Brigo;_Bernard_Hanzon_and_François_LeGland_(Filtering_Problem_(Stochastic_Processes)_Filtering_Problem_(Stochastic_Processes))&oldid=44946"