Items where authors include "Mahajan, M"

Article

Beyersdorff, O orcid.org/0000-0002-2870-1648, Blinkhorn, J and Mahajan, M (2021) Building Strategies into QBF Proofs. Journal of Automated Reasoning, 65 (2). pp. 125-154. ISSN 0168-7433

Beyersdorff, O, Chew, L, Mahajan, M et al. (1 more author) (2018) Understanding cutting planes for QBFs. Information and Computation, 262 (1). pp. 141-161. ISSN 0890-5401

Beyersdorff, O orcid.org/0000-0002-2870-1648, Chew, L, Mahajan, M et al. (1 more author) (2018) Are Short Proofs Narrow? QBF Resolution is not so Simple. ACM Transactions on Computational Logic, 19 (1). 1. ISSN 1529-3785

Beyersdorff, O orcid.org/0000-0002-2870-1648, Chew, L, Mahajan, M et al. (1 more author) (2017) Feasible Interpolation for QBF Resolution Calculi. Logical Methods in Computer Science, 13 (2). 7. ISSN 1860-5974

Beyersdorff, O, Datta, S, Krebs, A et al. (5 more authors) (2013) Verifying proofs in constant depth. ACM Transactions on Computation Theory (TOCT), 5 (1). 2. ISSN 1942-3454

Proceedings Paper

Beyersdorff, O orcid.org/0000-0002-2870-1648, Chew, L, Mahajan, M et al. (1 more author) (2016) Understanding Cutting Planes for QBFs. In: Proceedings of Foundations of Software Technology and Theoretical Computer Science (FSTTCS). 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 13-15 Dec 2016, Chennai, India. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Dagstuhl Publishing , pp. 1-15.

Beyersdorff, O, Chew, L, Mahajan, M et al. (1 more author) (2016) Are Short Proofs Narrow? QBF Resolution is not Simple. In: Ollinger, N and Vollmer, H, (eds.) 33rd Symposium on Theoretical Aspects of Computer Science (STACS'16). Symposium on Theoretical Aspects of Computer Science (STACS'16), 17-20 Feb 2016, Orleans, France. Schloss Dagstuhl - Leibniz-Zentrum für Informatik . ISBN 978-3-95977-001-9

Beyersdorff, O orcid.org/0000-0002-2870-1648, Chew, L, Mahajan, M et al. (1 more author) (2015) Feasible interpolation for QBF resolution calculi. In: 42nd International Colloquium on Automata, Languages, and Programming (ICALP'15). 42nd International Colloquium on Automata, Languages, and Programming (ICALP'15), 06-10 Jul 2015, Kyoto, Japan. Springer Verlag , pp. 180-192.

Beyersdorff, O, Vollmer, H, Datta, S et al. (4 more authors) (2011) Verifying proofs in constant depth. In: Proceedings MFCS 2011. Mathematical Foundations of Computer Science 2011, 22-26 Aug 2011, Warsaw, Poland. Springer Verlag , 84 - 95 . ISBN 978-3-642-22992-3