A simple way to reduce factorization problems to SAT
Computational Complexity
2020-04-29 v2 Logic in Computer Science
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.
Keywords
Cite
@article{arxiv.1708.02844,
title = {A simple way to reduce factorization problems to SAT},
author = {Davide Maran},
journal= {arXiv preprint arXiv:1708.02844},
year = {2020}
}
Comments
Poorly written, not very relevant