A study of QBF Merge Resolution and MaxSAT Resolution [HBNI Th221]

Gaurav Sood

dc.contributor.author	Gaurav Sood
dc.date.accessioned	2023-03-28T11:34:52Z
dc.date.available	2023-03-28T11:34:52Z
dc.date.issued	2023
dc.date.submitted	2023-03-07
dc.identifier.uri	https://dspace.imsc.res.in/xmlui/handle/123456789/610
dc.description.abstract	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	en_US
dc.publisher.publisher	The Institute of Mathematical Sciences
dc.subject	QBF Merge Resolution and MaxSAT Resolution	en_US
dc.title	A study of QBF Merge Resolution and MaxSAT Resolution [HBNI Th221]	en_US
dc.type.degree	Ph.D	en_US
dc.type.institution	HBNI	en_US
dc.description.advisor	Meena Mahajan
dc.description.pages	136p	en_US
dc.type.mainsub	Computer Science	en_US
dc.type.hbnibos	Mathematical Sciences