Author:
Shukla Ankit,Slivovsky Friedrich,Szeider Stefan
Publisher
Springer International Publishing
Reference21 articles.
1. Lecture Notes in Computer Science;V Balabanov,2014
2. Beyersdorff, O., Blinkhorn, J.: Dynamic QBF dependencies in reduction and expansion. ACM Trans. Comput. Log. 21(2), 8:1–8:27 (2020)
3. Beyersdorff, O., Blinkhorn, J., Hinde, L.: Size, cost, and capacity: a semantic technique for hard random QBFS. Logical Methods Comput. Sci. 15(1), (2019)
4. Beyersdorff, O., Chew, L., Janota, M.: New resolution-based QBF calculi and their proof complexity. TOCT 11(4), 26:1–26:42 (2019)
5. Lecture Notes in Computer Science;J Blinkhorn,2019
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献