Author:
Subramani K.,Wojciechowski P.
Publisher
Springer International Publishing
Reference28 articles.
1. Alekhnovich, M., Razborov, A.: Resolution is not automatizable unless W[P] is tractable. In: Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, FOCS 2001, pp. 210, USA. IEEE Computer Society (2001)
2. Lecture Notes in Computer Science;A Armando,2004
3. Atserias, A., Luisa Bonet, M.: On the automatizability of resolution and related propositional proof systems. Inf. Comput. 189(2), 182–201 (2004)
4. Atserias, A., Müller, M.: Automating resolution is NP-hard. CoRR, abs/1904.02991 (2019)
5. Beame, P., Pitassi, T.: Simplified and improved resolution lower bounds. In: 37th Annual Symposium on Foundations of Computer Science, pages 274–282, Burlington, Vermont, 14–16 October 1996. IEEE (1996)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献