Concepedia
Statistics
Publications
7
Citations
200
H-Index
Active since
2015
Affiliations
University of Leeds(Current)
Institute of Mathematical Sciences
Instituto de Engenharia de Sistemas e Computadores Investigação e Desenvolvimento
Leroy Chew is an author at University of Leeds specializing in computing, boolean algebra, and computer science.
Publications per year
2015–2020
Lower Bounds
Olaf Beyersdorff, Ilario Bonacina, Leroy Chew · 2016 · 54 citations
Computing, Computer Science, Mathematics +17
Proof Complexity of Resolution-based QBF Calculi
Olaf Beyersdorff, Leroy Chew, Mikoláš Janota · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2015 · 51 citations · Full text
Computing, Computer Science, Mathematics +15
New Resolution-Based QBF Calculi and Their Proof Complexity
Olaf Beyersdorff, Leroy Chew, Mikoláš Janota · ACM Transactions on Computation Theory · 2019 · 34 citations
Computing, Computer Science, Algorithms +13
Lower bounds: from circuits to QBF proof systems.
Olaf Beyersdorff, Ilario Bonacina, Leroy Chew · White Rose Research Online (University of Leeds, The University of Sheffield, University of York) · 2015 · 19 citations
Computing, Computer Engineering, Computer Science +14
Are Short Proofs Narrow? QBF Resolution is not Simple
Olaf Beyersdorff, Leroy Chew, Meena Mahajan et al. · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2016 · 15 citations · Full text
1–5 of 7