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].)
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Y. Asahiro, K. lwarna, and E. Miyano, Random generation of test instances with controlled attributes, in [Joh96], 377–393.
W. Diffie, The first ten years of public-key cryptography, in Contemporary Cryptology: The Science of Information Integrity (G.J. Simmons, ed.), IEEE Press (1992), 65–134.
S. Horie and O. Watanabe, Hard instance generation for SAT, Technical Report TR97-0007, Tokyo Inst. of 'Tech., 1997.
D.S. Johnson, ed., Clique, Coloring, and Satisfiability, DIMACS Series in Discrete Math. and Theoret. Comput. Sci., American Mathematical Society, 1996.
H. Kobayashi, personal communication.
D.E. Knuth, The Art of Computer Programming Vol.II (2nd ed.), Addison-Wesley, 1981.
A.K. Lenstra, H.W. Lenstra, Jr, Algorithms in number theory, Handbook of Theoretical Computer Science Vol.A (J. Van Leeuwen, ed.), Elsevier (1990), 673–715.
A. Schönhage and V. Strassen, Schnelle multiplikation grosser zahlen, Computing 7 (1971), 281–292.
B. Schneier, Applied Cryptography, John Wiley & Sons, Inc., 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Horie, S., Watanabe, O. (1997). Hard instance generation for SAT. In: Leong, H.W., Imai, H., Jain, S. (eds) Algorithms and Computation. ISAAC 1997. Lecture Notes in Computer Science, vol 1350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63890-3_4
Download citation
DOI: https://doi.org/10.1007/3-540-63890-3_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63890-2
Online ISBN: 978-3-540-69662-9
eBook Packages: Springer Book Archive