Publisher
Springer International Publishing
Reference25 articles.
1. Alekhnovich, M., Johannsen, J., Pitassi, T., Urquhart, A.: An exponential separation between regular and general resolution. In: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, pp. 448–456. ACM (2002)
2. Atserias, A., Bonacina, I., de Rezende, S.F., Lauria, M., Nordström, J., Razborov, A.: Clique is hard on average for regular resolution. In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, pp. 866–877 (2018)
3. Atserias, A., Müller, M.: Automating resolution is NP-hard. J. ACM (JACM) 67(5), 1–17 (2020)
4. Beame, P., Impagliazzo, R., Sabharwal, A.: The resolution complexity of independent sets and vertex covers in random graphs. Comput. Complex. 16(3), 245–297 (2007). https://doi.org/10.1007/s00037-007-0230-0
5. Beyersdorff, O., Galesi, N., Lauria, M.: Parameterized complexity of DPLL search procedures. ACM Trans. Comput. Log. (TOCL) 14(3), 20 (2013)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Clique Is Hard on Average for Unary Sherali-Adams;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06