Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A comparison of reductions from FACT to CNF-SAT
KTH, School of Computer Science and Communication (CSC).
KTH, School of Computer Science and Communication (CSC).
2014 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

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 (CNF-SAT), a well-known NP-complete problem. Some applications of this is toutilize advances in SAT solving for solving FACT, and for creating difficultCNF-SAT instances.This report compares four different reductions from FACT to CNF-SAT,based on the full adder, array multiplier and Wallace tree multiplier circuits.The comparisons were done by reducing a set of FACT instances to CNF-SATinstances with the different reductions. The resulting CNF-SAT instanceswere then compared with respect to the number of clauses and variables, aswell as the time taken to solve the instances with the SAT solver MiniSat.

Place, publisher, year, edition, pages
2014.
National Category
Computer Engineering
Identifiers
URN: urn:nbn:se:kth:diva-145983OAI: oai:DiVA.org:kth-145983DiVA: diva2:721407
Subject / course
Computer Science
Educational program
Bachelor of Science in Engineering - Computer Engineering
Supervisors
Examiners
Available from: 2015-05-28 Created: 2014-06-04 Last updated: 2015-05-28Bibliographically approved

Open Access in DiVA

fulltext(552 kB)139 downloads
File information
File name FULLTEXT01.pdfFile size 552 kBChecksum SHA-512
61fd55d4db4eb67fe9c514b511758ff648df5af7389289cb7ae369b6ac9874cccdfd01cc979b9f47be01eaae9bd8f29efb314c10a494aa5edc43e265f8b51b4f
Type fulltextMimetype application/pdf

Search in DiVA

By author/editor
Eriksson, JohnHöglund, Jonas
By organisation
School of Computer Science and Communication (CSC)
Computer Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 139 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 142 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf