Factoring integers with parallel SAT solvers
Factoring integers is a well known problem that at present cannot be solved in polynomial time. Therefore, other approaches for solving factorization problems are of interest. One such approach is to reduce factorization to SAT and solve it with a dedicated SAT solver. In this study, parallel SAT so...
Main Authors: | Lundén, Daniel, Forsblom, Erik |
---|---|
Format: | Others |
Language: | English |
Published: |
KTH, Skolan för datavetenskap och kommunikation (CSC)
2015
|
Subjects: | |
Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-166436 |
Similar Items
-
FACT- and SAT-solvers on different types of semiprimes
by: Sidenmark, Ludwig, et al.
Published: (2015) -
Attacking RSA moduli with SAT solvers
by: Asketorp, Jonatan
Published: (2014) -
Factorization patterns in 3-SAT : Analysis of clause ordering for reductions of the integer factorization problem
by: Häggvik, Adrian, et al.
Published: (2015) -
Sudoku Solvers
by: Johansson, Simon Johansson, et al.
Published: (2013) -
SAT doku Att lösa Sudoku med moderna SAT-lösare
by: AXELSSON, LUDVIG, et al.
Published: (2014)