1. Unprovability of Strong Complexity Lower Bounds in Bounded Arithmetic;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
2. Hardness Characterisations and Size-width Lower Bounds for QBF Resolution;ACM Transactions on Computational Logic;2023-01-27
3. Proof Complexity of Modal Resolution;Journal of Automated Reasoning;2021-10-13
4. Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution;Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science;2020-07-08
5. Frege Systems for Quantified Boolean Logic;Journal of the ACM;2020-05-09