Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Beyersdorff, Olaf
100  Ergebnisse:
Personensuche X
?
1

Should Decisions in QCDCL Follow Prefix Order?:

Böhm, Benjamin ; Peitl, Tomáš ; Beyersdorff, Olaf
Journal of Automated Reasoning.  68 (2024)  1 - p. , 2024
Link: https://doi.org/10.1007/..
 
?
2

Hard QBFs for Merge Resolution:

Beyersdorff, Olaf ; Blinkhorn, Joshua ; Mahajan, Meena..
ACM Transactions on Computation Theory.  16 (2024)  2 - p. 1-24 , 2024
Link: https://doi.org/10.1145/..
 
?
3

Hardness Characterisations and Size-width Lower Bounds for ..:

Beyersdorff, Olaf ; Blinkhorn, Joshua ; Mahajan, Meena.
ACM Transactions on Computational Logic.  24 (2023)  2 - p. 1-30 , 2023
Link: https://doi.org/10.1145/..
 
?
4

Understanding the Relative Strength of QBF CDCL Solvers and..:

Beyersdorff, Olaf ; Böhm, Benjamin
Logical Methods in Computer Science.  19, Issue 2 (2023)  - p. , 2023
Link: https://doi.org/10.46298..
 
?
5

Lower Bounds for QCDCL via Formula Gauge:

Böhm, Benjamin ; Beyersdorff, Olaf
Journal of Automated Reasoning.  67 (2023)  4 - p. , 2023
Link: https://doi.org/10.1007/..
 
?
6

Lower Bounds for QCDCL via Formula Gauge:

, In: Theory and Applications of Satisfiability Testing – SAT 2021; Lecture Notes in Computer Science,
Böhm, Benjamin ; Beyersdorff, Olaf - p. 47-63 , 2021
Link: https://doi.org/10.1007/..
 
?
7

QBFFam: A Tool for Generating QBF Families from Proof Compl..:

, In: Theory and Applications of Satisfiability Testing – SAT 2021; Lecture Notes in Computer Science,
Beyersdorff, Olaf ; Pulina, Luca ; Seidl, Martina. - p. 21-29 , 2021
Link: https://doi.org/10.1007/..
 
?
8

A simple proof of QBF hardness:

Beyersdorff, Olaf ; Blinkhorn, Joshua
Information Processing Letters.  168 (2021)  - p. 106093 , 2021
Link: https://doi.org/10.1016/..
 
?
9

Proof Complexity of Modal Resolution:

Sigley, Sarah ; Beyersdorff, Olaf
Journal of Automated Reasoning.  66 (2021)  1 - p. 1-41 , 2021
Link: https://doi.org/10.1007/..
 
?
10

Hardness Characterisations and Size-Width Lower Bounds for ..:

, In: Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science,
Beyersdorff, Olaf ; Blinkhorn, Joshua ; Mahajan, Meena - p. 209-223 , 2020
Link: https://dl.acm.org/doi/1..
 
?
11

Strong (D)QBF Dependency Schemes via Tautology-Free Resolut..:

, In: Theory and Applications of Satisfiability Testing – SAT 2020; Lecture Notes in Computer Science,
Beyersdorff, Olaf ; Blinkhorn, Joshua ; Peitl, Tomáš - p. 394-411 , 2020
Link: https://doi.org/10.1007/..
 
?
12

Building Strategies into QBF Proofs:

Beyersdorff, Olaf ; Blinkhorn, Joshua ; Mahajan, Meena
Journal of Automated Reasoning.  65 (2020)  1 - p. 125-154 , 2020
Link: https://doi.org/10.1007/..
 
?
13

Reasons for Hardness in QBF Proof Systems:

Beyersdorff, Olaf ; Hinde, Luke ; Pich, Ján
ACM Transactions on Computation Theory (TOCT).  12 (2020)  2 - p. 1-27 , 2020
Link: https://dl.acm.org/doi/1..
 
?
14

Frege Systems for Quantified Boolean Logic:

Beyersdorff, Olaf ; Bonacina, Ilario ; Chew, Leroy.
Journal of the ACM.  67 (2020)  2 - p. 1-36 , 2020
Link: https://doi.org/10.1145/..
 
?
15

Reasons for Hardness in QBF Proof Systems:

Beyersdorff, Olaf ; Hinde, Luke ; Pich, Ján
ACM Transactions on Computation Theory.  12 (2020)  2 - p. 1-27 , 2020
Link: https://doi.org/10.1145/..
 
1-15