Publisher
Springer Berlin Heidelberg
Reference9 articles.
1. Hamza, K.: The smallest uniform upper bound on the distance between the mean and the median of the binomial and poisson distributions. Statistics & Probability Letters 23(1), 21–25 (1995)
2. Hertli, T.: 3-SAT faster and simpler—unique-SAT bounds for PPSZ hold in general. In: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, pp. 277–284. IEEE Computer Soc., Los Alamitos (2011)
3. Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity. J. Comput. System Sci. 63(4), 512–530 (2001); Special issue on FOCS 1998 (Palo Alto, CA)
4. Iwama, K., Tamaki, S.: Improved upper bounds for 3-SAT. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithm, pp. 328–329 (electronic). ACM Press, New York (2004)
5. MacWilliams, F.F.J., Sloane, N.N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Algorithmic Applications of Hypergraph and Partition Containers;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
2. Hybrid divide-and-conquer approach for tree search algorithms;Quantum;2023-03-23
3. An Improvement of the Biased-PPSZ Algorithm for the 3SAT Problem;IEICE Transactions on Information and Systems;2022-03-01
4. PPSZ is better than you think;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
5. PPSZ for
k
≥ 5: More Is Better;ACM Transactions on Computation Theory;2019-09-17