Concepedia

Leroy Chew

LC

7

Publications

200

Citations

7

H-Index

2015

Active since

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 automated reasoning, formal verification, and formal methods.

Top concepts

EngineeringFormal MethodsComputer ScienceProof ComplexityAutomated ReasoningFormal VerificationComputational ComplexityCircuit ComplexitySatisfiabilityVerification

Publications per year

2015–2020

7

Publications

7

Lower Bounds

Olaf Beyersdorff, Ilario Bonacina, Leroy Chew · 2016 · 54 citations

Circuit Complexity, Engineering, Boolean Circuits +11

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

New Resolution-Based QBF Calculi and Their Proof Complexity

Olaf Beyersdorff, Leroy Chew, Mikoláš Janota · ACM Transactions on Computation Theory · 2019 · 34 citations

Circuit Complexity, Engineering, Automated Reasoning +14

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

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

Rows per page

1–5 of 7