P vs. NP asks: are these two classes actually the same? If P = NP, then every “hard” problem is secretly fast to solve; we ...
Abstract: The paper studies discrete-time statistical filtering problems with the goal to minimize expected total costs. Such problems are usually defined by pairs of stochastic equations and by ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results