Gaurav Sood
(The Institute of Mathematical Sciences, 2023)
In this thesis, we study the proof complexity of two proof systems: (i) Merge
Resolution proof system for Quantified Boolean Formulas (QBFs), and (ii) MaxSAT
Resolution proof system for certifying unsatisfiability