Publisher
Springer International Publishing
Reference8 articles.
1. Hertli, T.: 3-SAT faster and simpler-unique-SAT bounds for PPSZ hold in general. In: FOCS 2011, pp. 277–284 (2011)
2. Lecture Notes in Computer Science;T Hertli,2014
3. Hertli, T.: Improved exponential algorithms for SAT and ClSP. A thesis for Doctor of Sciences of ETH Zurich (2015)
4. Paturi, R., Pudlak, P., Saks, M.E., Zane, F.: An improved exponential-time algorithm for $$k$$ -SAT. J. ACM 52(3), 337–364 (2005)
5. Paturi, R., Pudlak, P., Zane, F.: Satisfiability coding lemma. Chicago J. Theor. Comput. Sci. 11–19 (1999)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Faster
k
-SAT algorithms using biased-PPSZ;Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing;2019-06-23