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

We consider several classical models in deterministic inventory theory: the single-item lot-sizing problem, the joint replenishment problem, and the multistage assembly problem. These inventory models ...

It has demonstrated the powerful ability of a quantum computer to perform certain computational tasks more efficiently than a classical computer. Thus, to show quantum advantages is a key problem in ...