default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Olaf Beyersdorff
@article{DBLP:journals/ai/BohmPB24,
author = {Benjamin B{\"{o}}hm and
Tom{\'{a}}s Peitl and
Olaf Beyersdorff},
title = {{QCDCL} with cube learning or pure literal elimination - What is best?},
journal = {Artif. Intell.},
volume = {336},
pages = {104194},
year = {2024},
url = {https://doi.org/10.1016/j.artint.2024.104194},
doi = {10.1016/J.ARTINT.2024.104194},
timestamp = {Sun, 08 Sep 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ai/BohmPB24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jar/BohmPB24,
author = {Benjamin B{\"{o}}hm and
Tom{\'{a}}s Peitl and
Olaf Beyersdorff},
title = {Should Decisions in {QCDCL} Follow Prefix Order?},
journal = {J. Autom. Reason.},
volume = {68},
number = {1},
pages = {5},
year = {2024},
url = {https://doi.org/10.1007/s10817-024-09694-6},
doi = {10.1007/S10817-024-09694-6},
timestamp = {Fri, 08 Mar 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jar/BohmPB24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/Beyersdorff0M24,
author = {Olaf Beyersdorff and
Benjamin B{\"{o}}hm and
Meena Mahajan},
editor = {Michael J. Wooldridge and
Jennifer G. Dy and
Sriraam Natarajan},
title = {Runtime vs. Extracted Proof Size: An Exponential Gap for {CDCL} on
QBFs},
booktitle = {Thirty-Eighth {AAAI} Conference on Artificial Intelligence, {AAAI}
2024, Thirty-Sixth Conference on Innovative Applications of Artificial
Intelligence, {IAAI} 2024, Fourteenth Symposium on Educational Advances
in Artificial Intelligence, {EAAI} 2014, February 20-27, 2024, Vancouver,
Canada},
pages = {7943--7951},
publisher = {{AAAI} Press},
year = {2024},
url = {https://doi.org/10.1609/aaai.v38i8.28631},
doi = {10.1609/AAAI.V38I8.28631},
timestamp = {Tue, 02 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/aaai/Beyersdorff0M24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BeyersdorffHKS24,
author = {Olaf Beyersdorff and
Tim Hoffmann and
Kaspar Kasche and
Luc Nicolas Spachmann},
editor = {Rastislav Kr{\'{a}}lovic and
Anton{\'{\i}}n Kucera},
title = {Polynomial Calculus for Quantified Boolean Logic: Lower Bounds Through
Circuits and Degree},
booktitle = {49th International Symposium on Mathematical Foundations of Computer
Science, {MFCS} 2024, August 26-30, 2024, Bratislava, Slovakia},
series = {LIPIcs},
volume = {306},
pages = {27:1--27:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.MFCS.2024.27},
doi = {10.4230/LIPICS.MFCS.2024.27},
timestamp = {Mon, 26 Aug 2024 16:40:52 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BeyersdorffHKS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/BeyersdorffFHHK24,
author = {Olaf Beyersdorff and
Johannes Klaus Fichte and
Markus Hecher and
Tim Hoffmann and
Kaspar Kasche},
editor = {Supratik Chakraborty and
Jie{-}Hong Roland Jiang},
title = {The Relative Strength of {\#}SAT Proof Systems},
booktitle = {27th International Conference on Theory and Applications of Satisfiability
Testing, {SAT} 2024, August 21-24, 2024, Pune, India},
series = {LIPIcs},
volume = {305},
pages = {5:1--5:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.SAT.2024.5},
doi = {10.4230/LIPICS.SAT.2024.5},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/BeyersdorffFHHK24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/stacs/2024,
editor = {Olaf Beyersdorff and
Mamadou Moustapha Kant{\'{e}} and
Orna Kupferman and
Daniel Lokshtanov},
title = {41st International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2024, March 12-14, 2024, Clermont-Ferrand, France},
series = {LIPIcs},
volume = {289},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://www.dagstuhl.de/dagpub/978-3-95977-311-9},
isbn = {978-3-95977-311-9},
timestamp = {Wed, 21 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/2024.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffHS24,
author = {Olaf Beyersdorff and
Tim Hoffmann and
Luc Nicolas Spachmann},
title = {Proof Complexity of Propositional Model Counting},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR24-030}},
year = {2024},
url = {https://eccc.weizmann.ac.il/report/2024/030},
eprinttype = {ECCC},
eprint = {TR24-030},
timestamp = {Thu, 08 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffHS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffKS24,
author = {Olaf Beyersdorff and
Kaspar Kasche and
Luc Nicolas Spachmann},
title = {Polynomial Calculus for Quantified Boolean Logic: Lower Bounds through
Circuits and Degree},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR24-038}},
year = {2024},
url = {https://eccc.weizmann.ac.il/report/2024/038},
eprinttype = {ECCC},
eprint = {TR24-038},
timestamp = {Thu, 08 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffKS24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/SchleitzerB23,
author = {Agnes Schleitzer and
Olaf Beyersdorff},
title = {Classes of Hard Formulas for {QBF} Resolution},
journal = {J. Artif. Intell. Res.},
volume = {77},
pages = {1455--1487},
year = {2023},
url = {https://doi.org/10.1613/jair.1.14710},
doi = {10.1613/JAIR.1.14710},
timestamp = {Thu, 31 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jair/SchleitzerB23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jar/BohmB23,
author = {Benjamin B{\"{o}}hm and
Olaf Beyersdorff},
title = {Lower Bounds for {QCDCL} via Formula Gauge},
journal = {J. Autom. Reason.},
volume = {67},
number = {4},
pages = {35},
year = {2023},
url = {https://doi.org/10.1007/s10817-023-09683-1},
doi = {10.1007/S10817-023-09683-1},
timestamp = {Wed, 01 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jar/BohmB23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/BeyersdorffB23,
author = {Olaf Beyersdorff and
Benjamin B{\"{o}}hm},
title = {Understanding the Relative Strength of {QBF} {CDCL} Solvers and {QBF}
Resolution},
journal = {Log. Methods Comput. Sci.},
volume = {19},
number = {2},
year = {2023},
url = {https://doi.org/10.46298/lmcs-19(2:2)2023},
doi = {10.46298/LMCS-19(2:2)2023},
timestamp = {Wed, 21 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/lmcs/BeyersdorffB23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/BeyersdorffBMP23,
author = {Olaf Beyersdorff and
Joshua Blinkhorn and
Meena Mahajan and
Tom{\'{a}}s Peitl},
title = {Hardness Characterisations and Size-width Lower Bounds for {QBF} Resolution},
journal = {{ACM} Trans. Comput. Log.},
volume = {24},
number = {2},
pages = {10:1--10:30},
year = {2023},
url = {https://doi.org/10.1145/3565286},
doi = {10.1145/3565286},
timestamp = {Sat, 13 May 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tocl/BeyersdorffBMP23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/BeyersdorffHS23,
author = {Olaf Beyersdorff and
Tim Hoffmann and
Luc Nicolas Spachmann},
editor = {Meena Mahajan and
Friedrich Slivovsky},
title = {Proof Complexity of Propositional Model Counting},
booktitle = {26th International Conference on Theory and Applications of Satisfiability
Testing, {SAT} 2023, July 4-8, 2023, Alghero, Italy},
series = {LIPIcs},
volume = {271},
pages = {2:1--2:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.SAT.2023.2},
doi = {10.4230/LIPICS.SAT.2023.2},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/BeyersdorffHS23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/0001B23,
author = {Benjamin B{\"{o}}hm and
Olaf Beyersdorff},
editor = {Meena Mahajan and
Friedrich Slivovsky},
title = {{QCDCL} vs {QBF} Resolution: Further Insights},
booktitle = {26th International Conference on Theory and Applications of Satisfiability
Testing, {SAT} 2023, July 4-8, 2023, Alghero, Italy},
series = {LIPIcs},
volume = {271},
pages = {4:1--4:17},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2023},
url = {https://doi.org/10.4230/LIPIcs.SAT.2023.4},
doi = {10.4230/LIPICS.SAT.2023.4},
timestamp = {Thu, 10 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/0001B23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/0001B23,
author = {Benjamin B{\"{o}}hm and
Olaf Beyersdorff},
title = {{QCDCL} vs {QBF} Resolution: Further Insights},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR23-051}},
year = {2023},
url = {https://eccc.weizmann.ac.il/report/2023/051},
eprinttype = {ECCC},
eprint = {TR23-051},
timestamp = {Tue, 13 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/0001B23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jar/SigleyB22,
author = {Sarah Sigley and
Olaf Beyersdorff},
title = {Proof Complexity of Modal Resolution},
journal = {J. Autom. Reason.},
volume = {66},
number = {1},
pages = {1--41},
year = {2022},
url = {https://doi.org/10.1007/s10817-021-09609-9},
doi = {10.1007/S10817-021-09609-9},
timestamp = {Fri, 21 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jar/SigleyB22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/0001PB22,
author = {Benjamin B{\"{o}}hm and
Tom{\'{a}}s Peitl and
Olaf Beyersdorff},
editor = {Luc De Raedt},
title = {{QCDCL} with Cube Learning or Pure Literal Elimination - What is Best?},
booktitle = {Proceedings of the Thirty-First International Joint Conference on
Artificial Intelligence, {IJCAI} 2022, Vienna, Austria, 23-29 July
2022},
pages = {1781--1787},
publisher = {ijcai.org},
year = {2022},
url = {https://doi.org/10.24963/ijcai.2022/248},
doi = {10.24963/IJCAI.2022/248},
timestamp = {Wed, 27 Jul 2022 16:43:00 +0200},
biburl = {https://dblp.org/rec/conf/ijcai/0001PB22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/SchleitzerB22,
author = {Agnes Schleitzer and
Olaf Beyersdorff},
editor = {Kuldeep S. Meel and
Ofer Strichman},
title = {Classes of Hard Formulas for {QBF} Resolution},
booktitle = {25th International Conference on Theory and Applications of Satisfiability
Testing, {SAT} 2022, August 2-5, 2022, Haifa, Israel},
series = {LIPIcs},
volume = {236},
pages = {5:1--5:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SAT.2022.5},
doi = {10.4230/LIPICS.SAT.2022.5},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/SchleitzerB22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/0001PB22,
author = {Benjamin B{\"{o}}hm and
Tom{\'{a}}s Peitl and
Olaf Beyersdorff},
editor = {Kuldeep S. Meel and
Ofer Strichman},
title = {Should Decisions in {QCDCL} Follow Prefix Order?},
booktitle = {25th International Conference on Theory and Applications of Satisfiability
Testing, {SAT} 2022, August 2-5, 2022, Haifa, Israel},
series = {LIPIcs},
volume = {236},
pages = {11:1--11:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.SAT.2022.11},
doi = {10.4230/LIPICS.SAT.2022.11},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/0001PB22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/BeyersdorffBGNO22,
author = {Olaf Beyersdorff and
Armin Biere and
Vijay Ganesh and
Jakob Nordstr{\"{o}}m and
Andy Oertel},
title = {Theory and Practice of {SAT} and Combinatorial Solving (Dagstuhl Seminar
22411)},
journal = {Dagstuhl Reports},
volume = {12},
number = {10},
pages = {84--105},
year = {2022},
url = {https://doi.org/10.4230/DagRep.12.10.84},
doi = {10.4230/DAGREP.12.10.84},
timestamp = {Mon, 01 Jul 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/BeyersdorffBGNO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/0001PB22,
author = {Benjamin B{\"{o}}hm and
Tom{\'{a}}s Peitl and
Olaf Beyersdorff},
title = {Should decisions in {QCDCL} follow prefix order?},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-040}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/040},
eprinttype = {ECCC},
eprint = {TR22-040},
timestamp = {Mon, 11 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/0001PB22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/SchleitzerB22,
author = {Agnes Schleitzer and
Olaf Beyersdorff},
title = {Classes of Hard Formulas for {QBF} Resolution},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR22-036}},
year = {2022},
url = {https://eccc.weizmann.ac.il/report/2022/036},
eprinttype = {ECCC},
eprint = {TR22-036},
timestamp = {Mon, 11 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/SchleitzerB22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BeyersdorffB21,
author = {Olaf Beyersdorff and
Joshua Blinkhorn},
title = {A simple proof of {QBF} hardness},
journal = {Inf. Process. Lett.},
volume = {168},
pages = {106093},
year = {2021},
url = {https://doi.org/10.1016/j.ipl.2021.106093},
doi = {10.1016/J.IPL.2021.106093},
timestamp = {Tue, 13 Apr 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BeyersdorffB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jar/BeyersdorffBM21,
author = {Olaf Beyersdorff and
Joshua Blinkhorn and
Meena Mahajan},
title = {Building Strategies into {QBF} Proofs},
journal = {J. Autom. Reason.},
volume = {65},
number = {1},
pages = {125--154},
year = {2021},
url = {https://doi.org/10.1007/s10817-020-09560-1},
doi = {10.1007/S10817-020-09560-1},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jar/BeyersdorffBM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BeyersdorffB21,
author = {Olaf Beyersdorff and
Benjamin B{\"{o}}hm},
editor = {James R. Lee},
title = {Understanding the Relative Strength of {QBF} {CDCL} Solvers and {QBF}
Resolution},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {12:1--12:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.12},
doi = {10.4230/LIPICS.ITCS.2021.12},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/BeyersdorffB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/BeyersdorffPSS21,
author = {Olaf Beyersdorff and
Luca Pulina and
Martina Seidl and
Ankit Shukla},
editor = {Chu{-}Min Li and
Felip Many{\`{a}}},
title = {QBFFam: {A} Tool for Generating {QBF} Families from Proof Complexity},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2021 - 24th
International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12831},
pages = {21--29},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-80223-3\_3},
doi = {10.1007/978-3-030-80223-3\_3},
timestamp = {Thu, 29 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/BeyersdorffPSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/BohmB21,
author = {Benjamin B{\"{o}}hm and
Olaf Beyersdorff},
editor = {Chu{-}Min Li and
Felip Many{\`{a}}},
title = {Lower Bounds for {QCDCL} via Formula Gauge},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2021 - 24th
International Conference, Barcelona, Spain, July 5-9, 2021, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12831},
pages = {47--63},
publisher = {Springer},
year = {2021},
url = {https://doi.org/10.1007/978-3-030-80223-3\_5},
doi = {10.1007/978-3-030-80223-3\_5},
timestamp = {Wed, 22 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/BohmB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:series/faia/BeyersdorffJLS21,
author = {Olaf Beyersdorff and
Mikol{\'{a}}s Janota and
Florian Lonsing and
Martina Seidl},
editor = {Armin Biere and
Marijn Heule and
Hans van Maaren and
Toby Walsh},
title = {Quantified Boolean Formulas},
booktitle = {Handbook of Satisfiability - Second Edition},
series = {Frontiers in Artificial Intelligence and Applications},
volume = {336},
pages = {1177--1221},
publisher = {{IOS} Press},
year = {2021},
url = {https://doi.org/10.3233/FAIA201015},
doi = {10.3233/FAIA201015},
timestamp = {Fri, 06 May 2022 08:03:54 +0200},
biburl = {https://dblp.org/rec/series/faia/BeyersdorffJLS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2109-04862,
author = {Olaf Beyersdorff and
Benjamin B{\"{o}}hm},
title = {Understanding the Relative Strength of {QBF} {CDCL} Solvers and {QBF}
Resolution},
journal = {CoRR},
volume = {abs/2109.04862},
year = {2021},
url = {https://arxiv.org/abs/2109.04862},
eprinttype = {arXiv},
eprint = {2109.04862},
timestamp = {Wed, 22 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2109-04862.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffB21,
author = {Olaf Beyersdorff and
Benjamin B{\"{o}}hm},
title = {{QCDCL} with Cube Learning or Pure Literal Elimination - What is best?},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR21-131}},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/131},
eprinttype = {ECCC},
eprint = {TR21-131},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffB21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffBP21,
author = {Olaf Beyersdorff and
Joshua Blinkhorn and
Tom{\'{a}}s Peitl},
title = {Strong {(D)QBF} Dependency Schemes via Implication-free Resolution
Paths},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR21-135}},
year = {2021},
url = {https://eccc.weizmann.ac.il/report/2021/135},
eprinttype = {ECCC},
eprint = {TR21-135},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffBP21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/BeyersdorffBCP20,
author = {Olaf Beyersdorff and
Ilario Bonacina and
Leroy Chew and
J{\'{a}}n Pich},
title = {Frege Systems for Quantified Boolean Logic},
journal = {J. {ACM}},
volume = {67},
number = {2},
pages = {9:1--9:36},
year = {2020},
url = {https://doi.org/10.1145/3381881},
doi = {10.1145/3381881},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/BeyersdorffBCP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BeyersdorffB20,
author = {Olaf Beyersdorff and
Joshua Blinkhorn},
title = {Lower Bound Techniques for {QBF} Expansion},
journal = {Theory Comput. Syst.},
volume = {64},
number = {3},
pages = {400--421},
year = {2020},
url = {https://doi.org/10.1007/s00224-019-09940-0},
doi = {10.1007/S00224-019-09940-0},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/mst/BeyersdorffB20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/BeyersdorffB20,
author = {Olaf Beyersdorff and
Joshua Blinkhorn},
title = {Dynamic {QBF} Dependencies in Reduction and Expansion},
journal = {{ACM} Trans. Comput. Log.},
volume = {21},
number = {2},
pages = {8:1--8:27},
year = {2020},
url = {https://doi.org/10.1145/3355995},
doi = {10.1145/3355995},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tocl/BeyersdorffB20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/BeyersdorffHP20,
author = {Olaf Beyersdorff and
Luke Hinde and
J{\'{a}}n Pich},
title = {Reasons for Hardness in {QBF} Proof Systems},
journal = {{ACM} Trans. Comput. Theory},
volume = {12},
number = {2},
pages = {10:1--10:27},
year = {2020},
url = {https://doi.org/10.1145/3378665},
doi = {10.1145/3378665},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toct/BeyersdorffHP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BeyersdorffBMPS20,
author = {Olaf Beyersdorff and
Joshua Blinkhorn and
Meena Mahajan and
Tom{\'{a}}s Peitl and
Gaurav Sood},
editor = {Nitin Saxena and
Sunil Simon},
title = {Hard QBFs for Merge Resolution},
booktitle = {40th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2020, December 14-18, 2020,
{BITS} Pilani, {K} {K} Birla Goa Campus, Goa, India (Virtual Conference)},
series = {LIPIcs},
volume = {182},
pages = {12:1--12:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2020.12},
doi = {10.4230/LIPICS.FSTTCS.2020.12},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/BeyersdorffBMPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/BeyersdorffBM20,
author = {Olaf Beyersdorff and
Joshua Blinkhorn and
Meena Mahajan},
editor = {Holger Hermanns and
Lijun Zhang and
Naoki Kobayashi and
Dale Miller},
title = {Hardness Characterisations and Size-Width Lower Bounds for {QBF} Resolution},
booktitle = {{LICS} '20: 35th Annual {ACM/IEEE} Symposium on Logic in Computer
Science, Saarbr{\"{u}}cken, Germany, July 8-11, 2020},
pages = {209--223},
publisher = {{ACM}},
year = {2020},
url = {https://doi.org/10.1145/3373718.3394793},
doi = {10.1145/3373718.3394793},
timestamp = {Sat, 30 Sep 2023 09:52:07 +0200},
biburl = {https://dblp.org/rec/conf/lics/BeyersdorffBM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/BeyersdorffBP20,
author = {Olaf Beyersdorff and
Joshua Blinkhorn and
Tom{\'{a}}s Peitl},
editor = {Luca Pulina and
Martina Seidl},
title = {Strong {(D)QBF} Dependency Schemes via Tautology-Free Resolution Paths},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2020 - 23rd
International Conference, Alghero, Italy, July 3-10, 2020, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {12178},
pages = {394--411},
publisher = {Springer},
year = {2020},
url = {https://doi.org/10.1007/978-3-030-51825-7\_28},
doi = {10.1007/978-3-030-51825-7\_28},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sat/BeyersdorffBP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-06779,
author = {Olaf Beyersdorff and
Joshua Blinkhorn and
Meena Mahajan and
Tom{\'{a}}s Peitl and
Gaurav Sood},
title = {Hard QBFs for Merge Resolution},
journal = {CoRR},
volume = {abs/2012.06779},
year = {2020},
url = {https://arxiv.org/abs/2012.06779},
eprinttype = {arXiv},
eprint = {2012.06779},
timestamp = {Fri, 03 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-06779.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/BeyersdorffEMN20,
author = {Olaf Beyersdorff and
Uwe Egly and
Meena Mahajan and
Cl{\'{a}}udia Nalon},
title = {{SAT} and Interactions (Dagstuhl Seminar 20061)},
journal = {Dagstuhl Reports},
volume = {10},
number = {2},
pages = {1--18},
year = {2020},
url = {https://doi.org/10.4230/DagRep.10.2.1},
doi = {10.4230/DAGREP.10.2.1},
timestamp = {Fri, 18 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/BeyersdorffEMN20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffB20,
author = {Olaf Beyersdorff and
Benjamin B{\"{o}}hm},
title = {Understanding the Relative Strength of {QBF} {CDCL} Solvers and {QBF}
Resolution},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-053}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/053},
eprinttype = {ECCC},
eprint = {TR20-053},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffB20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffBM20,
author = {Olaf Beyersdorff and
Joshua Blinkhorn and
Meena Mahajan},
title = {Hardness Characterisations and Size-Width Lower Bounds for {QBF} Resolution},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-005}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/005},
eprinttype = {ECCC},
eprint = {TR20-005},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffBM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffBMPS20,
author = {Olaf Beyersdorff and
Joshua Blinkhorn and
Meena Mahajan and
Tom{\'{a}}s Peitl and
Gaurav Sood},
title = {Hard QBFs for Merge Resolution},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-188}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/188},
eprinttype = {ECCC},
eprint = {TR20-188},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffBMPS20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffBP20,
author = {Olaf Beyersdorff and
Joshua Blinkhorn and
Tom{\'{a}}s Peitl},
title = {Strong {(D)QBF} Dependency Schemes via Tautology-free Resolution Paths},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-036}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/036},
eprinttype = {ECCC},
eprint = {TR20-036},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffBP20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BeyersdorffH19,
author = {Olaf Beyersdorff and
Luke Hinde},
title = {Characterising tree-like Frege proofs for {QBF}},
journal = {Inf. Comput.},
volume = {268},
year = {2019},
url = {https://doi.org/10.1016/j.ic.2019.05.002},
doi = {10.1016/J.IC.2019.05.002},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/BeyersdorffH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jar/BeyersdorffBCSS19,
author = {Olaf Beyersdorff and
Joshua Blinkhorn and
Leroy Chew and
Renate A. Schmidt and
Martin Suda},
title = {Reinterpreting Dependency Schemes: Soundness Meets Incompleteness
in {DQBF}},
journal = {J. Autom. Reason.},
volume = {63},
number = {3},
pages = {597--623},
year = {2019},
url = {https://doi.org/10.1007/s10817-018-9482-4},
doi = {10.1007/S10817-018-9482-4},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jar/BeyersdorffBCSS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/BeyersdorffCS19,
author = {Olaf Beyersdorff and
Leroy Chew and
Karteek Sreenivasaiah},
title = {A game characterisation of tree-like Q-Resolution size},
journal = {J. Comput. Syst. Sci.},
volume = {104},
pages = {82--101},
year = {2019},
url = {https://doi.org/10.1016/j.jcss.2016.11.011},
doi = {10.1016/J.JCSS.2016.11.011},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jcss/BeyersdorffCS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/BeyersdorffBH19,
author = {Olaf Beyersdorff and
Joshua Blinkhorn and
Luke Hinde},
title = {Size, Cost, and Capacity: {A} Semantic Technique for Hard Random QBFs},
journal = {Log. Methods Comput. Sci.},
volume = {15},
number = {1},
year = {2019},
url = {https://doi.org/10.23638/LMCS-15(1:13)2019},
doi = {10.23638/LMCS-15(1:13)2019},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/lmcs/BeyersdorffBH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/BeyersdorffCJ19,
author = {Olaf Beyersdorff and
Leroy Chew and
Mikol{\'{a}}s Janota},
title = {New Resolution-Based {QBF} Calculi and Their Proof Complexity},
journal = {{ACM} Trans. Comput. Theory},
volume = {11},
number = {4},
pages = {26:1--26:42},
year = {2019},
url = {https://doi.org/10.1145/3352155},
doi = {10.1145/3352155},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toct/BeyersdorffCJ19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/BeyersdorffCCM19,
author = {Olaf Beyersdorff and
Leroy Chew and
Judith Clymo and
Meena Mahajan},
editor = {Mikol{\'{a}}s Janota and
In{\^{e}}s Lynce},
title = {Short Proofs in {QBF} Expansion},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2019 - 22nd
International Conference, {SAT} 2019, Lisbon, Portugal, July 9-12,
2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11628},
pages = {19--35},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-24258-9\_2},
doi = {10.1007/978-3-030-24258-9\_2},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sat/BeyersdorffCCM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/BlinkhornB19,
author = {Joshua Blinkhorn and
Olaf Beyersdorff},
editor = {Mikol{\'{a}}s Janota and
In{\^{e}}s Lynce},
title = {Proof Complexity of {QBF} Symmetry Recomputation},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2019 - 22nd
International Conference, {SAT} 2019, Lisbon, Portugal, July 9-12,
2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11628},
pages = {36--52},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-24258-9\_3},
doi = {10.1007/978-3-030-24258-9\_3},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sat/BlinkhornB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BeyersdorffBM19,
author = {Olaf Beyersdorff and
Joshua Blinkhorn and
Meena Mahajan},
editor = {Rolf Niedermeier and
Christophe Paul},
title = {Building Strategies into {QBF} Proofs},
booktitle = {36th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2019, March 13-16, 2019, Berlin, Germany},
series = {LIPIcs},
volume = {126},
pages = {14:1--14:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.STACS.2019.14},
doi = {10.4230/LIPICS.STACS.2019.14},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BeyersdorffBM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffB19,
author = {Olaf Beyersdorff and
Joshua Blinkhorn},
title = {Proof Complexity of Symmetry Learning in {QBF}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-057}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/057},
eprinttype = {ECCC},
eprint = {TR19-057},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffB19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BeyersdorffCMS18,
author = {Olaf Beyersdorff and
Leroy Chew and
Meena Mahajan and
Anil Shukla},
title = {Understanding cutting planes for QBFs},
journal = {Inf. Comput.},
volume = {262},
pages = {141--161},
year = {2018},
url = {https://doi.org/10.1016/j.ic.2018.08.002},
doi = {10.1016/J.IC.2018.08.002},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/BeyersdorffCMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/ClymoB18,
author = {Judith Clymo and
Olaf Beyersdorff},
title = {Relating size and width in variants of Q-resolution},
journal = {Inf. Process. Lett.},
volume = {138},
pages = {1--6},
year = {2018},
url = {https://doi.org/10.1016/j.ipl.2018.05.005},
doi = {10.1016/J.IPL.2018.05.005},
timestamp = {Sat, 11 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/ClymoB18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/BeyersdorffCMS18,
author = {Olaf Beyersdorff and
Leroy Chew and
Meena Mahajan and
Anil Shukla},
title = {Are Short Proofs Narrow? {QBF} Resolution Is \emph{Not} So Simple},
journal = {{ACM} Trans. Comput. Log.},
volume = {19},
number = {1},
pages = {1:1--1:26},
year = {2018},
url = {https://doi.org/10.1145/3157053},
doi = {10.1145/3157053},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tocl/BeyersdorffCMS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/ijcai/BlinkhornB18,
author = {Joshua Blinkhorn and
Olaf Beyersdorff},
editor = {J{\'{e}}r{\^{o}}me Lang},
title = {Dynamic Dependency Awareness for {QBF}},
booktitle = {Proceedings of the Twenty-Seventh International Joint Conference on
Artificial Intelligence, {IJCAI} 2018, July 13-19, 2018, Stockholm,
Sweden},
pages = {5224--5228},
publisher = {ijcai.org},
year = {2018},
url = {https://doi.org/10.24963/ijcai.2018/726},
doi = {10.24963/IJCAI.2018/726},
timestamp = {Tue, 29 Dec 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/ijcai/BlinkhornB18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BeyersdorffBH18,
author = {Olaf Beyersdorff and
Joshua Blinkhorn and
Luke Hinde},
editor = {Anna R. Karlin},
title = {Size, Cost and Capacity: {A} Semantic Technique for Hard Random QBFs},
booktitle = {9th Innovations in Theoretical Computer Science Conference, {ITCS}
2018, January 11-14, 2018, Cambridge, MA, {USA}},
series = {LIPIcs},
volume = {94},
pages = {9:1--9:18},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2018.9},
doi = {10.4230/LIPICS.ITCS.2018.9},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/innovations/BeyersdorffBH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BeyersdorffB18,
author = {Olaf Beyersdorff and
Joshua Blinkhorn},
editor = {Rolf Niedermeier and
Brigitte Vall{\'{e}}e},
title = {Genuine Lower Bounds for {QBF} Expansion},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science, {STACS}
2018, February 28 to March 3, 2018, Caen, France},
series = {LIPIcs},
volume = {96},
pages = {12:1--12:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.STACS.2018.12},
doi = {10.4230/LIPICS.STACS.2018.12},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BeyersdorffB18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/sat/2018,
editor = {Olaf Beyersdorff and
Christoph M. Wintersteiger},
title = {Theory and Applications of Satisfiability Testing - {SAT} 2018 - 21st
International Conference, {SAT} 2018, Held as Part of the Federated
Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10929},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-319-94144-8},
doi = {10.1007/978-3-319-94144-8},
isbn = {978-3-319-94143-1},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/2018.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffBM18,
author = {Olaf Beyersdorff and
Joshua Blinkhorn and
Meena Mahajan},
title = {Building Strategies into {QBF} Proofs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-172}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/172},
eprinttype = {ECCC},
eprint = {TR18-172},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffBM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffC18,
author = {Olaf Beyersdorff and
Judith Clymo},
title = {More on Size and Width in {QBF} Resolution},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-025}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/025},
eprinttype = {ECCC},
eprint = {TR18-025},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffC18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffCCM18,
author = {Olaf Beyersdorff and
Leroy Chew and
Judith Clymo and
Meena Mahajan},
title = {Short Proofs in {QBF} Expansion},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-102}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/102},
eprinttype = {ECCC},
eprint = {TR18-102},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffCCM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffCDM18,
author = {Olaf Beyersdorff and
Judith Clymo and
Stefan S. Dantchev and
Barnaby Martin},
title = {The Riis Complexity Gap for {QBF} Resolution},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR18-024}},
year = {2018},
url = {https://eccc.weizmann.ac.il/report/2018/024},
eprinttype = {ECCC},
eprint = {TR18-024},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffCDM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/BeyersdorffCMS17,
author = {Olaf Beyersdorff and
Leroy Chew and
Meena Mahajan and
Anil Shukla},
title = {Feasible Interpolation for {QBF} Resolution Calculi},
journal = {Log. Methods Comput. Sci.},
volume = {13},
number = {2},
year = {2017},
url = {https://doi.org/10.23638/LMCS-13(2:7)2017},
doi = {10.23638/LMCS-13(2:7)2017},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/lmcs/BeyersdorffCMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BeyersdorffHP17,
author = {Olaf Beyersdorff and
Luke Hinde and
J{\'{a}}n Pich},
editor = {Satya V. Lokam and
R. Ramanujam},
title = {Reasons for Hardness in {QBF} Proof Systems},
booktitle = {37th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2017, December 11-15, 2017,
Kanpur, India},
series = {LIPIcs},
volume = {93},
pages = {14:1--14:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2017.14},
doi = {10.4230/LIPICS.FSTTCS.2017.14},
timestamp = {Fri, 03 Sep 2021 15:00:19 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/BeyersdorffHP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/BlinkhornB17,
author = {Joshua Blinkhorn and
Olaf Beyersdorff},
editor = {Serge Gaspers and
Toby Walsh},
title = {Shortening {QBF} Proofs with Dependency Schemes},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2017 - 20th
International Conference, Melbourne, VIC, Australia, August 28 - September
1, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10491},
pages = {263--280},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-319-66263-3\_17},
doi = {10.1007/978-3-319-66263-3\_17},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/BlinkhornB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1712-03626,
author = {Olaf Beyersdorff and
Joshua Blinkhorn and
Luke Hinde},
title = {Size, Cost, and Capacity: {A} Semantic Technique for Hard Random QBFs},
journal = {CoRR},
volume = {abs/1712.03626},
year = {2017},
url = {http://arxiv.org/abs/1712.03626},
eprinttype = {arXiv},
eprint = {1712.03626},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1712-03626.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffB17,
author = {Olaf Beyersdorff and
Joshua Blinkhorn},
title = {Formulas with Large Weight: a New Technique for Genuine {QBF} Lower
Bounds},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-032}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/032},
eprinttype = {ECCC},
eprint = {TR17-032},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffB17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffBH17,
author = {Olaf Beyersdorff and
Joshua Blinkhorn and
Luke Hinde},
title = {Size, Cost, and Capacity: {A} Semantic Technique for Hard Random QBFs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-137}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/137},
eprinttype = {ECCC},
eprint = {TR17-137},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffBH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffCMS17,
author = {Olaf Beyersdorff and
Leroy Chew and
Meena Mahajan and
Anil Shukla},
title = {Understanding Cutting Planes for QBFs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-037}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/037},
eprinttype = {ECCC},
eprint = {TR17-037},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffCMS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffHP17,
author = {Olaf Beyersdorff and
Luke Hinde and
J{\'{a}}n Pich},
title = {Reasons for Hardness in {QBF} Proof Systems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-044}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/044},
eprinttype = {ECCC},
eprint = {TR17-044},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffHP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/aaai/BeyersdorffCJ16,
author = {Olaf Beyersdorff and
Leroy Chew and
Mikolas Janota},
editor = {Adnan Darwiche},
title = {Extension Variables in {QBF} Resolution},
booktitle = {Beyond NP, Papers from the 2016 {AAAI} Workshop, Phoenix, Arizona,
USA, February 12, 2016},
series = {{AAAI} Technical Report},
volume = {{WS-16-05}},
publisher = {{AAAI} Press},
year = {2016},
url = {http://www.aaai.org/ocs/index.php/WS/AAAIW16/paper/view/12612},
timestamp = {Tue, 05 Sep 2023 08:59:27 +0200},
biburl = {https://dblp.org/rec/conf/aaai/BeyersdorffCJ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/BeyersdorffB16,
author = {Olaf Beyersdorff and
Joshua Blinkhorn},
editor = {Michel Rueher},
title = {Dependency Schemes in {QBF} Calculi: Semantics and Soundness},
booktitle = {Principles and Practice of Constraint Programming - 22nd International
Conference, {CP} 2016, Toulouse, France, September 5-9, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9892},
pages = {96--112},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-44953-1\_7},
doi = {10.1007/978-3-319-44953-1\_7},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cp/BeyersdorffB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BeyersdorffCMS16,
author = {Olaf Beyersdorff and
Leroy Chew and
Meena Mahajan and
Anil Shukla},
editor = {Akash Lal and
S. Akshay and
Saket Saurabh and
Sandeep Sen},
title = {Understanding Cutting Planes for QBFs},
booktitle = {36th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2016, December 13-15, 2016,
Chennai, India},
series = {LIPIcs},
volume = {65},
pages = {40:1--40:15},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2016.40},
doi = {10.4230/LIPICS.FSTTCS.2016.40},
timestamp = {Tue, 30 Nov 2021 13:29:05 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/BeyersdorffCMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/BeyersdorffBC16,
author = {Olaf Beyersdorff and
Ilario Bonacina and
Leroy Chew},
editor = {Madhu Sudan},
title = {Lower Bounds: From Circuits to {QBF} Proof Systems},
booktitle = {Proceedings of the 2016 {ACM} Conference on Innovations in Theoretical
Computer Science, Cambridge, MA, USA, January 14-16, 2016},
pages = {249--260},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2840728.2840740},
doi = {10.1145/2840728.2840740},
timestamp = {Tue, 14 Jun 2022 13:12:41 +0200},
biburl = {https://dblp.org/rec/conf/innovations/BeyersdorffBC16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/BeyersdorffP16,
author = {Olaf Beyersdorff and
J{\'{a}}n Pich},
editor = {Martin Grohe and
Eric Koskinen and
Natarajan Shankar},
title = {Understanding Gentzen and Frege Systems for {QBF}},
booktitle = {Proceedings of the 31st Annual {ACM/IEEE} Symposium on Logic in Computer
Science, {LICS} '16, New York, NY, USA, July 5-8, 2016},
pages = {146--155},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2933575.2933597},
doi = {10.1145/2933575.2933597},
timestamp = {Wed, 11 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lics/BeyersdorffP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/BlinkhornB16,
author = {Joshua Blinkhorn and
Olaf Beyersdorff},
editor = {Florian Lonsing and
Martina Seidl},
title = {Dependency Schemes in {QBF} Calculi: Semantics and Soundness},
booktitle = {Proceedings of the 4th International Workshop on Quantified Boolean
Formulas {(QBF} 2016) co-located with 19th International Conference
on Theory and Applications of Satisfiability Testing {(SAT} 2016),
Bordeaux, France, July 4, 2016},
series = {{CEUR} Workshop Proceedings},
volume = {1719},
pages = {41--48},
publisher = {CEUR-WS.org},
year = {2016},
url = {https://ceur-ws.org/Vol-1719/paper3.pdf},
timestamp = {Fri, 10 Mar 2023 16:23:33 +0100},
biburl = {https://dblp.org/rec/conf/sat/BlinkhornB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/BeyersdorffCS016,
author = {Olaf Beyersdorff and
Leroy Chew and
Renate A. Schmidt and
Martin Suda},
editor = {Nadia Creignou and
Daniel Le Berre},
title = {Lifting {QBF} Resolution Calculi to {DQBF}},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2016 - 19th
International Conference, Bordeaux, France, July 5-8, 2016, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9710},
pages = {490--499},
publisher = {Springer},
year = {2016},
url = {https://doi.org/10.1007/978-3-319-40970-2\_30},
doi = {10.1007/978-3-319-40970-2\_30},
timestamp = {Mon, 03 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/sat/BeyersdorffCS016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BeyersdorffCMS16,
author = {Olaf Beyersdorff and
Leroy Chew and
Meena Mahajan and
Anil Shukla},
editor = {Nicolas Ollinger and
Heribert Vollmer},
title = {Are Short Proofs Narrow? {QBF} Resolution is not Simple},
booktitle = {33rd Symposium on Theoretical Aspects of Computer Science, {STACS}
2016, February 17-20, 2016, Orl{\'{e}}ans, France},
series = {LIPIcs},
volume = {47},
pages = {15:1--15:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.STACS.2016.15},
doi = {10.4230/LIPICS.STACS.2016.15},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BeyersdorffCMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BeyersdorffCS016,
author = {Olaf Beyersdorff and
Leroy Chew and
Renate A. Schmidt and
Martin Suda},
title = {Lifting {QBF} Resolution Calculi to {DQBF}},
journal = {CoRR},
volume = {abs/1604.08058},
year = {2016},
url = {http://arxiv.org/abs/1604.08058},
eprinttype = {arXiv},
eprint = {1604.08058},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BeyersdorffCS016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BeyersdorffCMS16,
author = {Olaf Beyersdorff and
Leroy Chew and
Meena Mahajan and
Anil Shukla},
title = {Feasible Interpolation for {QBF} Resolution Calculi},
journal = {CoRR},
volume = {abs/1611.01328},
year = {2016},
url = {http://arxiv.org/abs/1611.01328},
eprinttype = {arXiv},
eprint = {1611.01328},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BeyersdorffCMS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/BeyersdorffCEV16,
author = {Olaf Beyersdorff and
Nadia Creignou and
Uwe Egly and
Heribert Vollmer},
title = {{SAT} and Interactions (Dagstuhl Seminar 16381)},
journal = {Dagstuhl Reports},
volume = {6},
number = {9},
pages = {74--93},
year = {2016},
url = {https://doi.org/10.4230/DagRep.6.9.74},
doi = {10.4230/DAGREP.6.9.74},
timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/BeyersdorffCEV16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffB16,
author = {Olaf Beyersdorff and
Joshua Blinkhorn},
title = {Dependency Schemes in {QBF} Calculi: Semantics and Soundness},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-028}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/028},
eprinttype = {ECCC},
eprint = {TR16-028},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffB16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffCJ16,
author = {Olaf Beyersdorff and
Leroy Chew and
Mikolas Janota},
title = {Extension Variables in {QBF} Resolution},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-005}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/005},
eprinttype = {ECCC},
eprint = {TR16-005},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffCJ16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffCSS16,
author = {Olaf Beyersdorff and
Leroy Chew and
Renate A. Schmidt and
Martin Suda},
title = {Lifting {QBF} Resolution Calculi to {DQBF}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-048}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/048},
eprinttype = {ECCC},
eprint = {TR16-048},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffCSS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffP16,
author = {Olaf Beyersdorff and
J{\'{a}}n Pich},
title = {Understanding Gentzen and Frege systems for {QBF}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-011}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/011},
eprinttype = {ECCC},
eprint = {TR16-011},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffP16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BeyersdorffCMS15,
author = {Olaf Beyersdorff and
Leroy Chew and
Meena Mahajan and
Anil Shukla},
editor = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
Kazuo Iwama and
Naoki Kobayashi and
Bettina Speckmann},
title = {Feasible Interpolation for {QBF} Resolution Calculi},
booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
{ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {9134},
pages = {180--192},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-47672-7\_15},
doi = {10.1007/978-3-662-47672-7\_15},
timestamp = {Thu, 23 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BeyersdorffCMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/BeyersdorffCS15,
author = {Olaf Beyersdorff and
Leroy Chew and
Karteek Sreenivasaiah},
editor = {Adrian{-}Horia Dediu and
Enrico Formenti and
Carlos Mart{\'{\i}}n{-}Vide and
Bianca Truthe},
title = {A Game Characterisation of Tree-like Q-resolution Size},
booktitle = {Language and Automata Theory and Applications - 9th International
Conference, {LATA} 2015, Nice, France, March 2-6, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8977},
pages = {486--498},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-15579-1\_38},
doi = {10.1007/978-3-319-15579-1\_38},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lata/BeyersdorffCS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BeyersdorffCJ15,
author = {Olaf Beyersdorff and
Leroy Chew and
Mikol{\'{a}}s Janota},
editor = {Ernst W. Mayr and
Nicolas Ollinger},
title = {Proof Complexity of Resolution-based {QBF} Calculi},
booktitle = {32nd International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2015, March 4-7, 2015, Garching, Germany},
series = {LIPIcs},
volume = {30},
pages = {76--89},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.STACS.2015.76},
doi = {10.4230/LIPICS.STACS.2015.76},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/BeyersdorffCJ15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffBC15,
author = {Olaf Beyersdorff and
Ilario Bonacina and
Leroy Chew},
title = {Lower bounds: from circuits to {QBF} proof systems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-133}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/133},
eprinttype = {ECCC},
eprint = {TR15-133},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffBC15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffCMS15,
author = {Olaf Beyersdorff and
Leroy Chew and
Meena Mahajan and
Anil Shukla},
title = {Feasible Interpolation for {QBF} Resolution Calculi},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-059}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/059},
eprinttype = {ECCC},
eprint = {TR15-059},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffCMS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffCMS15a,
author = {Olaf Beyersdorff and
Leroy Chew and
Meena Mahajan and
Anil Shukla},
title = {Are Short Proofs Narrow? {QBF} Resolution is not Simple},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-152}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/152},
eprinttype = {ECCC},
eprint = {TR15-152},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffCMS15a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cade/BeyersdorffC14,
author = {Olaf Beyersdorff and
Leroy Chew},
editor = {St{\'{e}}phane Demri and
Deepak Kapur and
Christoph Weidenbach},
title = {The Complexity of Theorem Proving in Circumscription and Minimal Entailment},
booktitle = {Automated Reasoning - 7th International Joint Conference, {IJCAR}
2014, Held as Part of the Vienna Summer of Logic, {VSL} 2014, Vienna,
Austria, July 19-22, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8562},
pages = {403--417},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08587-6\_32},
doi = {10.1007/978-3-319-08587-6\_32},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/cade/BeyersdorffC14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BeyersdorffCJ14,
author = {Olaf Beyersdorff and
Leroy Chew and
Mikolas Janota},
editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Martin Dietzfelbinger and
Zolt{\'{a}}n {\'{E}}sik},
title = {On Unification of {QBF} Resolution-Based Calculi},
booktitle = {Mathematical Foundations of Computer Science 2014 - 39th International
Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {8635},
pages = {81--93},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44465-8\_8},
doi = {10.1007/978-3-662-44465-8\_8},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BeyersdorffCJ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/BeyersdorffK14,
author = {Olaf Beyersdorff and
Oliver Kullmann},
editor = {Carsten Sinz and
Uwe Egly},
title = {Unified Characterisations of Resolution Hardness Measures},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2014 - 17th
International Conference, Held as Part of the Vienna Summer of Logic,
{VSL} 2014, Vienna, Austria, July 14-17, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8561},
pages = {170--187},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-09284-3\_13},
doi = {10.1007/978-3-319-09284-3\_13},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/BeyersdorffK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BeyersdorffC14,
author = {Olaf Beyersdorff and
Leroy Chew},
title = {Tableau vs. Sequent Calculi for Minimal Entailment},
journal = {CoRR},
volume = {abs/1405.1565},
year = {2014},
url = {http://arxiv.org/abs/1405.1565},
eprinttype = {arXiv},
eprint = {1405.1565},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BeyersdorffC14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/BeyersdorffHKS14,
author = {Olaf Beyersdorff and
Edward A. Hirsch and
Jan Kraj{\'{\i}}cek and
Rahul Santhanam},
title = {Optimal algorithms and proofs (Dagstuhl Seminar 14421)},
journal = {Dagstuhl Reports},
volume = {4},
number = {10},
pages = {51--68},
year = {2014},
url = {https://doi.org/10.4230/DagRep.4.10.51},
doi = {10.4230/DAGREP.4.10.51},
timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/BeyersdorffHKS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffC14,
author = {Olaf Beyersdorff and
Leroy Chew},
title = {The Complexity of Theorem Proving in Circumscription and Minimal Entailment},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-014}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/014},
eprinttype = {ECCC},
eprint = {TR14-014},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffC14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffC14a,
author = {Olaf Beyersdorff and
Leroy Chew},
title = {Tableau vs. Sequent Calculi for Minimal Entailment},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-032}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/032},
eprinttype = {ECCC},
eprint = {TR14-032},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffC14a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffCJ14,
author = {Olaf Beyersdorff and
Leroy Chew and
Mikolas Janota},
title = {Proof Complexity of Resolution-based {QBF} Calculi},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-120}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/120},
eprinttype = {ECCC},
eprint = {TR14-120},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffCJ14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffCS14,
author = {Olaf Beyersdorff and
Leroy Chew and
Karteek Sreenivasaiah},
title = {A game characterisation of tree-like Q-Resolution size},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-131}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/131},
eprinttype = {ECCC},
eprint = {TR14-131},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffCS14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/JanotaCB14,
author = {Mikolas Janota and
Leroy Chew and
Olaf Beyersdorff},
title = {On Unification of {QBF} Resolution-Based Calculi},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-036}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/036},
eprinttype = {ECCC},
eprint = {TR14-036},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/JanotaCB14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BeyersdorffGL13,
author = {Olaf Beyersdorff and
Nicola Galesi and
Massimo Lauria},
title = {A characterization of tree-like Resolution size},
journal = {Inf. Process. Lett.},
volume = {113},
number = {18},
pages = {666--671},
year = {2013},
url = {https://doi.org/10.1016/j.ipl.2013.06.002},
doi = {10.1016/J.IPL.2013.06.002},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BeyersdorffGL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/BeyersdorffGL13,
author = {Olaf Beyersdorff and
Nicola Galesi and
Massimo Lauria},
title = {Parameterized Complexity of {DPLL} Search Procedures},
journal = {{ACM} Trans. Comput. Log.},
volume = {14},
number = {3},
pages = {20:1--20:21},
year = {2013},
url = {https://doi.org/10.1145/2499937.2499941},
doi = {10.1145/2499937.2499941},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tocl/BeyersdorffGL13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/BeyersdorffDKMSSTV13,
author = {Olaf Beyersdorff and
Samir Datta and
Andreas Krebs and
Meena Mahajan and
Gido Scharfenberger{-}Fabian and
Karteek Sreenivasaiah and
Michael Thomas and
Heribert Vollmer},
title = {Verifying proofs in constant depth},
journal = {{ACM} Trans. Comput. Theory},
volume = {5},
number = {1},
pages = {2:1--2:23},
year = {2013},
url = {https://doi.org/10.1145/2462896.2462898},
doi = {10.1145/2462896.2462898},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/BeyersdorffDKMSSTV13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/Beyersdorff13,
author = {Olaf Beyersdorff},
editor = {Matti J{\"{a}}rvisalo and
Allen Van Gelder},
title = {The Complexity of Theorem Proving in Autoepistemic Logic},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2013 - 16th
International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7962},
pages = {365--376},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39071-5\_27},
doi = {10.1007/978-3-642-39071-5\_27},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/Beyersdorff13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Beyersdorff13,
author = {Olaf Beyersdorff},
title = {The Complexity of Theorem Proving in Autoepistemic Logic},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-016}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/016},
eprinttype = {ECCC},
eprint = {TR13-016},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Beyersdorff13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@book{DBLP:books/daglib/0030197,
author = {Olaf Beyersdorff},
title = {Non-classical Aspects in Proof Complexity},
publisher = {Cuvillier},
year = {2012},
url = {http://www.cuvillier.de/flycms/de/html/30/-UickI3zKPS3wdko=/Buchdetails.html?SID=6bUyfUc5b9bb},
isbn = {978-3-9540403-6-0},
timestamp = {Wed, 09 Jan 2013 00:00:00 +0100},
biburl = {https://dblp.org/rec/books/daglib/0030197.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/logcom/BeyersdorffMTV12,
author = {Olaf Beyersdorff and
Arne Meier and
Michael Thomas and
Heribert Vollmer},
title = {The complexity of reasoning for fragments of default logic},
journal = {J. Log. Comput.},
volume = {22},
number = {3},
pages = {587--604},
year = {2012},
url = {https://doi.org/10.1093/logcom/exq061},
doi = {10.1093/LOGCOM/EXQ061},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/logcom/BeyersdorffMTV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/BeyersdorffGLR12,
author = {Olaf Beyersdorff and
Nicola Galesi and
Massimo Lauria and
Alexander A. Razborov},
title = {Parameterized Bounded-Depth Frege Is not Optimal},
journal = {{ACM} Trans. Comput. Theory},
volume = {4},
number = {3},
pages = {7:1--7:16},
year = {2012},
url = {https://doi.org/10.1145/2355580.2355582},
doi = {10.1145/2355580.2355582},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/BeyersdorffGLR12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffDKMSSTV12,
author = {Olaf Beyersdorff and
Samir Datta and
Andreas Krebs and
Meena Mahajan and
Gido Scharfenberger{-}Fabian and
Karteek Sreenivasaiah and
Michael Thomas and
Heribert Vollmer},
title = {Verifying Proofs in Constant Depth},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-079}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/079},
eprinttype = {ECCC},
eprint = {TR12-079},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffDKMSSTV12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffGL12,
author = {Olaf Beyersdorff and
Nicola Galesi and
Massimo Lauria},
title = {A Characterization of Tree-Like Resolution Size},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-161}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/161},
eprinttype = {ECCC},
eprint = {TR12-161},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffGL12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/BeyersdorffMMTV11,
author = {Olaf Beyersdorff and
Arne Meier and
Sebastian M{\"{u}}ller and
Michael Thomas and
Heribert Vollmer},
title = {Proof complexity of propositional default logic},
journal = {Arch. Math. Log.},
volume = {50},
number = {7-8},
pages = {727--742},
year = {2011},
url = {https://doi.org/10.1007/s00153-011-0245-8},
doi = {10.1007/S00153-011-0245-8},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/BeyersdorffMMTV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1103-4990,
author = {Olaf Beyersdorff and
Arne Meier and
Martin Mundhenk and
Thomas Schneider and
Michael Thomas and
Heribert Vollmer},
title = {Model Checking {CTL} is Almost Always Inherently Sequential},
journal = {Log. Methods Comput. Sci.},
volume = {7},
number = {2},
year = {2011},
url = {https://doi.org/10.2168/LMCS-7(2:12)2011},
doi = {10.2168/LMCS-7(2:12)2011},
timestamp = {Sun, 16 Apr 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1103-4990.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/BeyersdorffKM11,
author = {Olaf Beyersdorff and
Johannes K{\"{o}}bler and
Sebastian M{\"{u}}ller},
title = {Proof systems that take advice},
journal = {Inf. Comput.},
volume = {209},
number = {3},
pages = {320--332},
year = {2011},
url = {https://doi.org/10.1016/j.ic.2010.11.006},
doi = {10.1016/J.IC.2010.11.006},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/BeyersdorffKM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/BeyersdorffS11,
author = {Olaf Beyersdorff and
Zenon Sadowski},
title = {Do there exist complete sets for promise classes?},
journal = {Math. Log. Q.},
volume = {57},
number = {6},
pages = {535--550},
year = {2011},
url = {https://doi.org/10.1002/malq.201010021},
doi = {10.1002/MALQ.201010021},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlq/BeyersdorffS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esslli/BeyersdorffK11,
author = {Olaf Beyersdorff and
Oliver Kutz},
editor = {Nick Bezhanishvili and
Valentin Goranko},
title = {Proof Complexity of Non-classical Logics},
booktitle = {Lectures on Logic and Computation - {ESSLLI} 2010 Copenhagen, Denmark,
August 2010, {ESSLLI} 2011, Ljubljana, Slovenia, August 2011, Selected
Lecture Notes},
series = {Lecture Notes in Computer Science},
volume = {7388},
pages = {1--54},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-31485-8\_1},
doi = {10.1007/978-3-642-31485-8\_1},
timestamp = {Mon, 01 May 2023 13:01:40 +0200},
biburl = {https://dblp.org/rec/conf/esslli/BeyersdorffK11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BeyersdorffGLR11,
author = {Olaf Beyersdorff and
Nicola Galesi and
Massimo Lauria and
Alexander A. Razborov},
editor = {Luca Aceto and
Monika Henzinger and
Jir{\'{\i}} Sgall},
title = {Parameterized Bounded-Depth Frege Is Not Optimal},
booktitle = {Automata, Languages and Programming - 38th International Colloquium,
{ICALP} 2011, Zurich, Switzerland, July 4-8, 2011, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6755},
pages = {630--641},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22006-7\_53},
doi = {10.1007/978-3-642-22006-7\_53},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/BeyersdorffGLR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BeyersdorffDMSSTV11,
author = {Olaf Beyersdorff and
Samir Datta and
Meena Mahajan and
Gido Scharfenberger{-}Fabian and
Karteek Sreenivasaiah and
Michael Thomas and
Heribert Vollmer},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Verifying Proofs in Constant Depth},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {84--95},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_11},
doi = {10.1007/978-3-642-22993-0\_11},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BeyersdorffDMSSTV11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/BeyersdorffGL11,
author = {Olaf Beyersdorff and
Nicola Galesi and
Massimo Lauria},
editor = {Karem A. Sakallah and
Laurent Simon},
title = {Parameterized Complexity of {DPLL} Search Procedures},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2011 - 14th
International Conference, {SAT} 2011, Ann Arbor, MI, USA, June 19-22,
2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6695},
pages = {5--18},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-21581-0\_3},
doi = {10.1007/978-3-642-21581-0\_3},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/BeyersdorffGL11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BeyersdorffGL10,
author = {Olaf Beyersdorff and
Nicola Galesi and
Massimo Lauria},
title = {A lower bound for the pigeonhole principle in tree-like Resolution
by asymmetric Prover-Delayer games},
journal = {Inf. Process. Lett.},
volume = {110},
number = {23},
pages = {1074--1077},
year = {2010},
url = {https://doi.org/10.1016/j.ipl.2010.09.007},
doi = {10.1016/J.IPL.2010.09.007},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ipl/BeyersdorffGL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Beyersdorff10,
author = {Olaf Beyersdorff},
title = {The Deduction Theorem for Strong Propositional Proof Systems},
journal = {Theory Comput. Syst.},
volume = {47},
number = {1},
pages = {162--178},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9146-6},
doi = {10.1007/S00224-008-9146-6},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Beyersdorff10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/BeyersdorffM10,
author = {Olaf Beyersdorff and
Sebastian M{\"{u}}ller},
title = {A tight Karp-Lipton collapse result in bounded arithmetic},
journal = {{ACM} Trans. Comput. Log.},
volume = {11},
number = {4},
pages = {22:1--22:23},
year = {2010},
url = {https://doi.org/10.1145/1805950.1805952},
doi = {10.1145/1805950.1805952},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tocl/BeyersdorffM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/BeyersdorffMMTV10,
author = {Olaf Beyersdorff and
Arne Meier and
Sebastian M{\"{u}}ller and
Michael Thomas and
Heribert Vollmer},
editor = {Ofer Strichman and
Stefan Szeider},
title = {Proof Complexity of Propositional Default Logic},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2010, 13th
International Conference, {SAT} 2010, Edinburgh, UK, July 11-14, 2010.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6175},
pages = {30--43},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14186-7\_5},
doi = {10.1007/978-3-642-14186-7\_5},
timestamp = {Sat, 19 Oct 2019 20:28:15 +0200},
biburl = {https://dblp.org/rec/conf/sat/BeyersdorffMMTV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/Beyersdorff10,
author = {Olaf Beyersdorff},
editor = {Jan Kratochv{\'{\i}}l and
Angsheng Li and
Jir{\'{\i}} Fiala and
Petr Kolman},
title = {Proof Complexity of Non-classical Logics},
booktitle = {Theory and Applications of Models of Computation, 7th Annual Conference,
{TAMC} 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6108},
pages = {15--27},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13562-0\_3},
doi = {10.1007/978-3-642-13562-0\_3},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/Beyersdorff10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/BeyersdorffM10,
author = {Olaf Beyersdorff and
Sebastian M{\"{u}}ller},
editor = {Jan Kratochv{\'{\i}}l and
Angsheng Li and
Jir{\'{\i}} Fiala and
Petr Kolman},
title = {Different Approaches to Proof Systems},
booktitle = {Theory and Applications of Models of Computation, 7th Annual Conference,
{TAMC} 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6108},
pages = {50--59},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13562-0\_6},
doi = {10.1007/978-3-642-13562-0\_6},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/BeyersdorffM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/BeyersdorffGL10,
author = {Olaf Beyersdorff and
Nicola Galesi and
Massimo Lauria},
editor = {Benjamin Rossman and
Thomas Schwentick and
Denis Th{\'{e}}rien and
Heribert Vollmer},
title = {Hardness of Parameterized Resolution},
booktitle = {Circuits, Logic, and Games, 07.02. - 12.02.2010},
series = {Dagstuhl Seminar Proceedings},
volume = {10061},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2010},
url = {http://drops.dagstuhl.de/opus/volltexte/2010/2525/},
timestamp = {Thu, 10 Jun 2021 13:02:04 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/BeyersdorffGL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/BeyersdorffMMTV10,
author = {Olaf Beyersdorff and
Arne Meier and
Sebastian M{\"{u}}ller and
Michael Thomas and
Heribert Vollmer},
editor = {Benjamin Rossman and
Thomas Schwentick and
Denis Th{\'{e}}rien and
Heribert Vollmer},
title = {Proof Complexity of Propositional Default Logic},
booktitle = {Circuits, Logic, and Games, 07.02. - 12.02.2010},
series = {Dagstuhl Seminar Proceedings},
volume = {10061},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2010},
url = {http://drops.dagstuhl.de/opus/volltexte/2010/2526/},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/BeyersdorffMMTV10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffGL10,
author = {Olaf Beyersdorff and
Nicola Galesi and
Massimo Lauria},
title = {Hardness of Parameterized Resolution},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-059}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/059},
eprinttype = {ECCC},
eprint = {TR10-059},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffGL10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffGL10a,
author = {Olaf Beyersdorff and
Nicola Galesi and
Massimo Lauria},
title = {A Lower Bound for the Pigeonhole Principle in Tree-like Resolution
by Asymmetric Prover-Delayer Games},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-081}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/081},
eprinttype = {ECCC},
eprint = {TR10-081},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffGL10a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffGLR10,
author = {Olaf Beyersdorff and
Nicola Galesi and
Massimo Lauria and
Alexander A. Razborov},
title = {Parameterized Bounded-Depth Frege is Not Optimal},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-198}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/198},
eprinttype = {ECCC},
eprint = {TR10-198},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffGLR10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/Beyersdorff09,
author = {Olaf Beyersdorff},
title = {Comparing axiomatizations of free pseudospaces},
journal = {Arch. Math. Log.},
volume = {48},
number = {7},
pages = {625--641},
year = {2009},
url = {https://doi.org/10.1007/s00153-009-0140-8},
doi = {10.1007/S00153-009-0140-8},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/Beyersdorff09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/BeyersdorffMTV09,
author = {Olaf Beyersdorff and
Arne Meier and
Michael Thomas and
Heribert Vollmer},
title = {The complexity of propositional implication},
journal = {Inf. Process. Lett.},
volume = {109},
number = {18},
pages = {1071--1077},
year = {2009},
url = {https://doi.org/10.1016/j.ipl.2009.06.015},
doi = {10.1016/J.IPL.2009.06.015},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ipl/BeyersdorffMTV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/Beyersdorff09,
author = {Olaf Beyersdorff},
title = {On the correspondence between arithmetic theories and propositional
proof systems - a survey},
journal = {Math. Log. Q.},
volume = {55},
number = {2},
pages = {116--137},
year = {2009},
url = {https://doi.org/10.1002/malq.200710069},
doi = {10.1002/MALQ.200710069},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlq/Beyersdorff09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/BeyersdorffKM09,
author = {Olaf Beyersdorff and
Johannes K{\"{o}}bler and
Jochen Messner},
title = {Nondeterministic functions and the existence of optimal proof systems},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {38-40},
pages = {3839--3855},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2009.05.021},
doi = {10.1016/J.TCS.2009.05.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/BeyersdorffKM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/atmos/BeyersdorffN09,
author = {Olaf Beyersdorff and
Yevgen Nebesov},
editor = {Jens Clausen and
Gabriele Di Stefano},
title = {Edges as Nodes - a New Approach to Timetable Information},
booktitle = {{ATMOS} 2009 - 9th Workshop on Algorithmic Approaches for Transportation
Modeling, Optimization, and Systems, {IT} University of Copenhagen,
Denmark, September 10, 2009},
series = {OASIcs},
volume = {12},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
year = {2009},
url = {http://drops.dagstuhl.de/opus/volltexte/2009/2147},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/atmos/BeyersdorffN09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/BeyersdorffS09,
author = {Olaf Beyersdorff and
Zenon Sadowski},
editor = {Anna E. Frid and
Andrey Morozov and
Andrey Rybalchenko and
Klaus W. Wagner},
title = {Characterizing the Existence of Optimal Proof Systems and Complete
Sets for Promise Classes},
booktitle = {Computer Science - Theory and Applications, Fourth International Computer
Science Symposium in Russia, {CSR} 2009, Novosibirsk, Russia, August
18-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5675},
pages = {47--58},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03351-3\_7},
doi = {10.1007/978-3-642-03351-3\_7},
timestamp = {Mon, 01 Mar 2021 13:46:21 +0100},
biburl = {https://dblp.org/rec/conf/csr/BeyersdorffS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/BeyersdorffKM09,
author = {Olaf Beyersdorff and
Johannes K{\"{o}}bler and
Sebastian M{\"{u}}ller},
editor = {Adrian{-}Horia Dediu and
Armand{-}Mihai Ionescu and
Carlos Mart{\'{\i}}n{-}Vide},
title = {Nondeterministic Instance Complexity and Proof Systems with Advice},
booktitle = {Language and Automata Theory and Applications, Third International
Conference, {LATA} 2009, Tarragona, Spain, April 2-8, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5457},
pages = {164--175},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00982-2\_14},
doi = {10.1007/978-3-642-00982-2\_14},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lata/BeyersdorffKM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/BeyersdorffMTV09,
author = {Olaf Beyersdorff and
Arne Meier and
Michael Thomas and
Heribert Vollmer},
editor = {Oliver Kullmann},
title = {The Complexity of Reasoning for Fragments of Default Logic},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2009, 12th
International Conference, {SAT} 2009, Swansea, UK, June 30 - July
3, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5584},
pages = {51--64},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02777-2\_7},
doi = {10.1007/978-3-642-02777-2\_7},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/BeyersdorffMTV09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/BeyersdorffM09,
author = {Olaf Beyersdorff and
Sebastian M{\"{u}}ller},
editor = {Oliver Kullmann},
title = {Does Advice Help to Prove Propositional Tautologies?},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2009, 12th
International Conference, {SAT} 2009, Swansea, UK, June 30 - July
3, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5584},
pages = {65--72},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02777-2\_8},
doi = {10.1007/978-3-642-02777-2\_8},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/BeyersdorffM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/synasc/Beyersdorff09,
author = {Olaf Beyersdorff},
editor = {Stephen M. Watt and
Viorel Negru and
Tetsuo Ida and
Tudor Jebelean and
Dana Petcu and
Daniela Zaharie},
title = {On the Existence of Complete Disjoint NP-Pairs},
booktitle = {11th International Symposium on Symbolic and Numeric Algorithms for
Scientific Computing, {SYNASC} 2009, Timisoara, Romania, September
26-29, 2009},
pages = {282--289},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/SYNASC.2009.9},
doi = {10.1109/SYNASC.2009.9},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/synasc/Beyersdorff09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/time/BeyersdorffMTVMS09,
author = {Olaf Beyersdorff and
Arne Meier and
Michael Thomas and
Heribert Vollmer and
Martin Mundhenk and
Thomas Schneider},
editor = {Carsten Lutz and
Jean{-}Fran{\c{c}}ois Raskin},
title = {Model Checking {CTL} is Almost Always Inherently Sequential},
booktitle = {{TIME} 2009, 16th International Symposium on Temporal Representation
and Reasoning, Bressanone-Brixen, Italy, 23-25 July 2009, Proceedings},
pages = {21--28},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/TIME.2009.12},
doi = {10.1109/TIME.2009.12},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/time/BeyersdorffMTVMS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffKM09,
author = {Olaf Beyersdorff and
Johannes K{\"{o}}bler and
Sebastian M{\"{u}}ller},
title = {Proof Systems that Take Advice},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-092}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/092},
eprinttype = {ECCC},
eprint = {TR09-092},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffKM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffS09,
author = {Olaf Beyersdorff and
Zenon Sadowski},
title = {Characterizing the Existence of Optimal Proof Systems and Complete
Sets for Promise Classes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-081}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/081},
eprinttype = {ECCC},
eprint = {TR09-081},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffS09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/Beyersdorff08,
author = {Olaf Beyersdorff},
title = {Tuples of Disjoint NP-Sets},
journal = {Theory Comput. Syst.},
volume = {43},
number = {2},
pages = {118--135},
year = {2008},
url = {https://doi.org/10.1007/s00224-007-9023-8},
doi = {10.1007/S00224-007-9023-8},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/Beyersdorff08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/BeyersdorffM08,
author = {Olaf Beyersdorff and
Sebastian M{\"{u}}ller},
editor = {Michael Kaminski and
Simone Martini},
title = {A Tight Karp-Lipton Collapse Result in Bounded Arithmetic},
booktitle = {Computer Science Logic, 22nd International Workshop, {CSL} 2008, 17th
Annual Conference of the EACSL, Bertinoro, Italy, September 16-19,
2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5213},
pages = {199--214},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-87531-4\_16},
doi = {10.1007/978-3-540-87531-4\_16},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csl/BeyersdorffM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/Beyersdorff08,
author = {Olaf Beyersdorff},
editor = {Manindra Agrawal and
Ding{-}Zhu Du and
Zhenhua Duan and
Angsheng Li},
title = {Logical Closure Properties of Propositional Proof Systems},
booktitle = {Theory and Applications of Models of Computation, 5th International
Conference, {TAMC} 2008, Xi'an, China, April 25-29, 2008. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4978},
pages = {318--329},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-79228-4\_28},
doi = {10.1007/978-3-540-79228-4\_28},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/Beyersdorff08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0808-3884,
author = {Olaf Beyersdorff and
Arne Meier and
Michael Thomas and
Heribert Vollmer},
title = {The Complexity of Reasoning for Fragments of Default Logic},
journal = {CoRR},
volume = {abs/0808.3884},
year = {2008},
url = {http://arxiv.org/abs/0808.3884},
eprinttype = {arXiv},
eprint = {0808.3884},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0808-3884.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0811-0959,
author = {Olaf Beyersdorff and
Arne Meier and
Michael Thomas and
Heribert Vollmer},
title = {The Complexity of Propositional Implication},
journal = {CoRR},
volume = {abs/0811.0959},
year = {2008},
url = {http://arxiv.org/abs/0811.0959},
eprinttype = {arXiv},
eprint = {0811.0959},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0811-0959.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/BeyersdorffKM08,
author = {Olaf Beyersdorff and
Johannes K{\"{o}}bler and
Sebastian M{\"{u}}ller},
title = {Nondeterministic Instance Complexity and Proof Systems with Advice},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR08-075}},
year = {2008},
url = {https://eccc.weizmann.ac.il/eccc-reports/2008/TR08-075/index.html},
eprinttype = {ECCC},
eprint = {TR08-075},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/BeyersdorffKM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Beyersdorff07,
author = {Olaf Beyersdorff},
title = {Classes of representable disjoint NP-pairs},
journal = {Theor. Comput. Sci.},
volume = {377},
number = {1-3},
pages = {93--109},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2007.02.005},
doi = {10.1016/J.TCS.2007.02.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Beyersdorff07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Beyersdorff07,
author = {Olaf Beyersdorff},
editor = {Vikraman Arvind and
Sanjiva Prasad},
title = {The Deduction Theorem for Strong Propositional Proof Systems},
booktitle = {{FSTTCS} 2007: Foundations of Software Technology and Theoretical
Computer Science, 27th International Conference, New Delhi, India,
December 12-14, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4855},
pages = {241--252},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77050-3\_20},
doi = {10.1007/978-3-540-77050-3\_20},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Beyersdorff07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/de/Beyersdorff2006,
author = {Olaf Beyersdorff},
title = {Disjoint NP-pairs and propositional proof systems},
school = {Humboldt University of Berlin, Unter den Linden, Germany},
year = {2006},
url = {http://edoc.hu-berlin.de/dissertationen/beyersdorff-olaf-2006-07-22/PDF/beyersdorff.pdf},
urn = {urn:nbn:de:kobv:11-10067498},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/de/Beyersdorff2006.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/Beyersdorff06,
author = {Olaf Beyersdorff},
editor = {Dima Grigoriev and
John Harrison and
Edward A. Hirsch},
title = {Tuples of Disjoint NP-Sets},
booktitle = {Computer Science - Theory and Applications, First International Symposium
on Computer Science in Russia, {CSR} 2006, St. Petersburg, Russia,
June 8-12, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3967},
pages = {80--91},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11753728\_11},
doi = {10.1007/11753728\_11},
timestamp = {Tue, 29 Nov 2022 13:36:56 +0100},
biburl = {https://dblp.org/rec/conf/csr/Beyersdorff06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/Beyersdorff06,
author = {Olaf Beyersdorff},
editor = {Jin{-}yi Cai and
S. Barry Cooper and
Angsheng Li},
title = {Disjoint NP-Pairs from Propositional Proof Systems},
booktitle = {Theory and Applications of Models of Computation, Third International
Conference, {TAMC} 2006, Beijing, China, May 15-20, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3959},
pages = {236--247},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11750321\_23},
doi = {10.1007/11750321\_23},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/Beyersdorff06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Beyersdorff06,
author = {Olaf Beyersdorff},
title = {On the Deduction Theorem and Complete Disjoint NP-Pairs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-142}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-142/index.html},
eprinttype = {ECCC},
eprint = {TR06-142},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/Beyersdorff06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-083,
author = {Olaf Beyersdorff},
title = {Disjoint NP-Pairs from Propositional Proof Systems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-083}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-083/index.html},
eprinttype = {ECCC},
eprint = {TR05-083},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-083.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-123,
author = {Olaf Beyersdorff},
title = {Tuples of Disjoint NP-Sets},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-123}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-123/index.html},
eprinttype = {ECCC},
eprint = {TR05-123},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-123.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Beyersdorff04,
author = {Olaf Beyersdorff},
editor = {Kamal Lodaya and
Meena Mahajan},
title = {Representable Disjoint NP-Pairs},
booktitle = {{FSTTCS} 2004: Foundations of Software Technology and Theoretical
Computer Science, 24th International Conference, Chennai, India, December
16-18, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3328},
pages = {122--134},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30538-5\_11},
doi = {10.1007/978-3-540-30538-5\_11},
timestamp = {Sun, 02 Jun 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Beyersdorff04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-082,
author = {Olaf Beyersdorff},
title = {Representable Disjoint NP-Pairs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-082}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-082/index.html},
eprinttype = {ECCC},
eprint = {TR04-082},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-082.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-10 02:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
