Recognizing more random unsatisfiable 3-SAT instances efficiently-Reference-Cited by-同舟云学术

Recognizing more random unsatisfiable 3-SAT instances efficiently

Published:2003-10 Issue: Volume:16 Page:21-46
ISSN:1571-0653
Container-title:Electronic Notes in Discrete Mathematics
language:en
Short-container-title:Electronic Notes in Discrete Mathematics

Author:

Goerdt Andreas,Lanka André

Publisher

Elsevier BV

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics

Reference11 articles.

1. Fan R. K. Chung. Spectral Graph Theory. CBMS Regional Conference Series in Mathematics, Vol. 92. American Mathematical Society, Providence, R. I.,1997.

2. A. Coja-Oghlan, A. Goerdt, A. Lanka, F. Schädlich. Certifying Unsatisfiability of Random 2k-SAT Formulas using Approximation Techniques. In Proceedings FCT 2003. To appear.

3. U. Feige. Relations between average case complexity and approximation complexity. In Proceedings STOC 2002.

4. U. Feige, E. Ofek. Spectral Techniques Applied to Sparse Random Graphs. 2003. Available at http://wisdomarchive.wisdom.weizmann.ac.il:81/archive/00000307/

5. Necessary and Sufficient Conditions for Sharp Thresholds of Graph Properties and the k-SAT problem;Friedgut;Journal of the American Mathematical Society,1999

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

1. Efficient Algorithms for Semirandom Planted CSPs at the Refutation Threshold;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. On the Complexity of Random Satisfiability Problems with Planted Solutions;SIAM Journal on Computing;2018-01

3. On the Complexity of Random Satisfiability Problems with Planted Solutions;Proceedings of the forty-seventh annual ACM symposium on Theory of Computing;2015-06-14

4. Short propositional refutations for dense random 3CNF formulas;Annals of Pure and Applied Logic;2014-12

5. Sparser Random 3-SAT Refutation Algorithms and the Interpolation Problem;Automata, Languages, and Programming;2014