QBF Proof Complexity

Chew, Leroy Nicholas (2017) QBF Proof Complexity. PhD thesis, University of Leeds.



Keywords: QBF Proof Complexity, Circuit Complexity, Lower Bounds DQBF Resolution
Awarding institution: University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds)
Identification Number/EthosID (e.g. uk.bl.ethos.123456): uk.bl.ethos.723199
Depositing User: Mr Leroy Chew
Date Deposited: 26 Sep 2017 11:30
Last Modified: 25 Jul 2018 09:55


Final eThesis - complete (pdf)

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.