A simple way to reduce factorization problems to SAT

A simple way to reduce factorization problems to SAT

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.

Gespeichert in:
Bibliographische Detailangaben
1. Verfasser: Maran, Davide
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science - Computational Complexity
Computer Science - Logic in Computer Science
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
DOI:10.48550/arxiv.1708.02844