k-SAT Is No Harder Than Decision-Unique-k-SAT-Reference-Cited by-同舟云学术

k-SAT Is No Harder Than Decision-Unique-k-SAT

Published:2009 Issue: Volume: Page:59-70
ISSN:0302-9743
Container-title:Computer Science - Theory and Applications
language:
Short-container-title:

Author:

Calabro Chris,Paturi Ramamohan

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-03351-3_8

Reference10 articles.

1. Calabro, C., Impagliazzo, R., Kabanets, V., Paturi, R.: The complexity of Unique k-SAT: An isolation lemma for k-CNFs. Journal of Computer and System Sciences 74(3), 386–393 (2008)

2. Dubois, O., Dequen, G.: A backbone-search heuristic for efficient solving of hard 3-SAT formulae. In: Proceedings of the 17th International Joint Conference on Artificial Intelligence, pp. 248–253 (2001)

3. Grandjean, E., Büning, H.: SAT-problems and reductions with respect to the number of variables. Journal of Logic and Computation 7(4), 457–471 (1997)

4. Håstad, J.: Some optimal inapproximability results. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, pp. 1–10. ACM Press, New York (1997)

5. Impagliazzo, R., Paturi, R., Zane, F.: Which Problems Have Strongly Exponential Complexity? Journal of Computer and System Sciences 63, 512–530 (2001)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Transition Phenomenon of (1,0)-d-Regular (k, s)-SAT;Electronics;2022-08-08

2. Uniquely Satisfiable d-Regular (k,s)-SAT Instances;Entropy;2020-05-19

3. Exponential Complexity of Satisfiability Testing for Linear-Size Boolean Formulas;Lecture Notes in Computer Science;2013

4. On Moderately Exponential Time for SAT;Theory and Applications of Satisfiability Testing – SAT 2010;2010