A comparison of reductions from FACT to CNF-SAT
The integer factorisation problem (FACT) is a well-known number-theoreticproblem, with many applications in areas such as cryptography. An instanceof a FACT problem (a number n such that n = p × q) can be reduced to aninstance of the conjunctive normal form boolean satisfiability problem (CNFSAT),a...
| Main Authors: | , |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
KTH, Skolan för datavetenskap och kommunikation (CSC)
2014
|
| Subjects: | |
| Online Access: | http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-157342 |