Luke Hinde

Publication Activity (10 Years)

Years Active: 2017-2021
Publications (10 Years): 9

Top Topics

Quantified Boolean Formulae

Semantic Annotation

Storage Requirements

Top Venues

Electron. Colloquium Comput. Complex.

ACM Trans. Comput. Theory

Publications

Robin Bloomfield, Gareth Fletcher, Heidy Khlaaf, Luke Hinde, Philippa Ryan
Safety Case Templates for Autonomous Systems. CoRR (2021)
Olaf Beyersdorff, Luke Hinde, Ján Pich
Reasons for Hardness in QBF Proof Systems. ACM Trans. Comput. Theory 12 (2) (2020)
Olaf Beyersdorff, Luke Hinde
Characterising tree-like Frege proofs for QBF. Inf. Comput. 268 (2019)
Olaf Beyersdorff, Joshua Blinkhorn, Luke Hinde
Size, Cost, and Capacity: A Semantic Technique for Hard Random QBFs. Log. Methods Comput. Sci. 15 (1) (2019)
Olaf Beyersdorff, Joshua Blinkhorn, Luke Hinde
Size, Cost and Capacity: A Semantic Technique for Hard Random QBFs. ITCS (2018)
Olaf Beyersdorff, Joshua Blinkhorn, Luke Hinde
Size, Cost, and Capacity: A Semantic Technique for Hard Random QBFs. Electron. Colloquium Comput. Complex. 24 (2017)
Olaf Beyersdorff, Luke Hinde, Ján Pich
Reasons for Hardness in QBF Proof Systems. FSTTCS (2017)
Olaf Beyersdorff, Joshua Blinkhorn, Luke Hinde
Size, Cost, and Capacity: A Semantic Technique for Hard Random QBFs. CoRR (2017)
Olaf Beyersdorff, Luke Hinde, Ján Pich
Reasons for Hardness in QBF Proof Systems. Electron. Colloquium Comput. Complex. 24 (2017)