Hard instance generation for SAT

Extended abstract
  • Satoshi Horie
  • Osamu Watanabe
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1350)

Abstract

We consider the problem of generating hard instances for the Satisfying Assignment 'TechSearch Problem (in short, SAT). It is not known whether SAT is difficult on average, while it has been believed that the Factorization Problem (in short, FACT) is hard on average. Thus, one can expect to generate hard-on-average instances by using a reduction from FACT to SAT. Although the asymptotically best reduction is obtained by using the Fast Fourier Transform [SS71], its constant factor is too big in practice. Here we propose to use the Chinese Remainder Theorem for constructing efficient yet simple reductions from FACT to SAT. (In this extended abstract, most proofs are omitted; see [HW97].)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1997

Authors and Affiliations

  • Satoshi Horie
    • 1
  • Osamu Watanabe
    • 1
  1. 1.Department of Computer ScienceTokyo Institute of TechnologyJapan

Personalised recommendations