Found 4 Documents (Results 1–4)
Hardness and optimality in QBF proof systems modulo NP. (English) Zbl 07495568
Li, Chu-Min (ed.) et al., Theory and applications of satisfiability testing – SAT 2021. 24th international conference, Barcelona, Spain, July 5–9, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12831, 98-115 (2021).
How QBF expansion makes strategy extraction hard. (English) Zbl 07614507
Peltier, Nicolas (ed.) et al., Automated reasoning. 10th international joint conference, IJCAR 2020, Paris, France, July 1–4, 2020. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 12166, 66-82 (2020).
MSC:
68V15
Filter Results by …
Document Type
- Journal Articles (2)
- Collection Articles (2)
all
top 5
Author
- Chew, Leroy (4)
- Beyersdorff, Olaf (1)
- Blinkhorn, Joshua (1)
- Clymo, Judith (1)
- Schmidt, Renate A. (1)
- Slivovsky, Friedrich (1)
- Suda, Martin (1)