An efficient algorithm for determining the linear complexity and the minimal polynomial of a binary sequence with period 2npm is proposed and proved, where 2 is
The theory of "point estimate" and the concept of "general convergence",which were put forward by Smale in order to investigate the complexity of algorithms for
The support properties of the super Brownian motion with random immigration Xρ1 are considered,where the immigration rate is governed by the trajectory of anot