Hard instance generation for SAT

Simple item page
dc.creatorHorie, Satoshi
dc.creatorWatanabe, Osamu
dc.date1998-09-28
dc.date1998-09-29
dc.date.accessioned2026-07-07T03:23:42Z
dc.date.available2026-07-07T03:23:42Z
dc.descriptionWe propose an algorithm of generating hard instances for the Satisfying Assignment Search Problem (in short, SAT). The algorithm transforms instances of the integer factorization problem into SAT instances efficiently by using the Chinese Remainder Theorem. For example, it is possible to construct SAT instances with about 5,600 variables that is as hard as factorizing 100 bit integers.
dc.identifierhttps://arxiv.org/abs/cs/9809117
dc.identifierhttp://arxiv.org/abs/cs/9809117
dc.identifierIn the Proc. of ISAAC'97, Lecture Notes in CS, Vol.1350, 22-31, 1997
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/33045
dc.subjectComputational Complexity
dc.subjectF.2
dc.titleHard instance generation for SAT
dc.typetext

Files

Collections

arXiv