In this work we focus on the problem of factoring semi-primes with SAT-solvers. A semi-prime N is a composite of two primes p and q which are roughly of equal size. These particular composites are ...

Abstract: The problem of giving a spectral factorization of a class of matrices arising in Wiener filtering theory and network synthesis is tackled via an algebraic procedure. A quadratic matrix ...

Abstract: A matrix factorization problem is considered. The matrix is algebraic and belongs to the Jones–Moiseev class. A new method of factorization is proposed. The matrix factorization problem is ...

ABSTRACT: In this paper is demonstrated a method for reduction of integer factorization problem to an analysis of a sequence of modular elliptic equations. As a result, the paper provides a ...

Non-negative matrix factorization is a powerful tool for dimensionality reduction and data analysis. Here I have implemented a solver that takes missing entries into account when solving the NNMF ...

Description and implementation of the Shor's algorithm (to solve the prime factorization problem) using the IBM SDK Qiskit and the framework ProjectQ.