A simple way to reduce factorization problems to SAT

Abstract

As Cook-Levin theorem showed, every NP problem can be reduced to SAT in polynomial time. In this paper I show a simpler and more efficent method to reduce some factorization problems to the satisfability of a boolean formula.

arXiv commentPoorly written, not very relevant