Proof Complexity for Quantified Boolean Formulas

Clymo, Judith Caroline (2020) Proof Complexity for Quantified Boolean Formulas. PhD thesis, University of Leeds.



Keywords: proof complexity; QBF
Awarding institution: University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds)
Identification Number/EthosID (e.g.
Depositing User: Mrs Judith Caroline Clymo
Date Deposited: 07 May 2021 08:43
Last Modified: 11 Jun 2021 09:53


Final eThesis - complete (pdf)

Filename: Clymo thesis.pdf

Description: J Clymo PhD thesis

Licence: Creative Commons Licence
This work is licensed under a Creative Commons Attribution NonCommercial ShareAlike 4.0 International License

Share / Export


You do not need to contact us to get a copy of this thesis. Please use the 'Download' link(s) above to get a copy.
You can contact us about this thesis. If you need to make a general enquiry, please see the Contact us page.