Leroy Chew

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
Relating existing powerful proof systems for QBF	2024-07-12	Paper
Towards uniform certification in QBF	2024-04-23	Paper
Towards Uniform Certification in QBF	2024-03-11	Paper
How QBF expansion makes strategy extraction hard	2022-11-09	Paper
Hardness and optimality in QBF proof systems modulo NP	2022-03-22	Paper
Sorting parity encodings by reusing variables	2021-04-07	Paper
Avoiding Monochromatic Rectangles Using Shift Patterns	2020-12-23	Paper
Frege Systems for Quantified Boolean Logic	2020-11-11	Paper
Short proofs in QBF expansion	2020-05-20	Paper
The equivalences of refutational QRAT	2020-05-20	Paper
New Resolution-Based QBF Calculi and Their Proof Complexity	2019-12-16	Paper
Reinterpreting dependency schemes: soundness meets incompleteness in DQBF	2019-09-02	Paper
A game characterisation of tree-like Q-resolution size	2019-06-25	Paper
Understanding cutting planes for QBFs	2018-09-27	Paper
https://portal.mardi4nfdi.de/entity/Q4636589	2018-04-19	Paper
Are Short Proofs Narrow? QBF Resolution Is Not So Simple	2018-03-22	Paper
Are Short Proofs Narrow? QBF Resolution is not Simple.	2018-01-24	Paper
https://portal.mardi4nfdi.de/entity/Q5270089	2017-06-22	Paper
https://portal.mardi4nfdi.de/entity/Q2954985	2017-01-24	Paper
Lifting QBF Resolution Calculi to DQBF	2016-09-05	Paper
A Game Characterisation of Tree-like Q-resolution Size	2016-04-08	Paper
Feasible Interpolation for QBF Resolution Calculi	2015-10-27	Paper
On Unification of QBF Resolution-Based Calculi	2014-10-14	Paper
The Complexity of Theorem Proving in Circumscription and Minimal Entailment	2014-09-26	Paper

Research outcomes over time

This page was built for person: Leroy Chew