Complexity theory is a fundamental branch of theoretical computer science that categorises computational problems according to their inherent difficulty and the resources required to solve them. At ...

Memcomputing is a novel non-Turing paradigm of computation that uses interacting memory cells (memprocessors for short) to store and process information on the same physical platform. It was recently ...

In this article we present applications of smooth numbers to the unconditional derandomization of some well-known integer factoring algorithms. We begin with Pollard's p – 1 algorithm, which finds in ...

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 ...

What differentiates humans from computers? Is it only a matter of time before efficient algorithms enable a computer to perform the most creative tasks, even to the extent of proving mathematical ...