A simple way to reduce factorization problems to SAT

TL;DR

This paper presents a simpler and more efficient method for reducing certain factorization problems to SAT, building on the foundational Cook-Levin theorem for NP problems.

Contribution

The paper introduces a novel reduction technique that simplifies and improves the efficiency of translating factorization problems into SAT instances.

Findings

The new reduction method is simpler than previous approaches.

It demonstrates improved efficiency in solving factorization problems via SAT.

The approach can be applied to specific classes of factorization problems.

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.