In computational complexity theory, P and NP are two classes of problems. P is the class of decision problems that a deterministic Turing machine can solve in polynomial time. In useful terms, any ...

SIAM Journal on Applied Mathematics, Vol. 16, No. 6 (Nov., 1968), pp. 1280-1304 (25 pages) The smoothing and prediction of continuous time series with a deterministic signal is considered. It is shown ...