Algorithms for Linearly Ordered Boolean Formulas

dc.contributor.author	Egeland, Christian
dc.date.accessioned	2016-08-22T09:26:53Z
dc.date.available	2016-08-22T09:26:53Z
dc.date.issued	2016-06-30
dc.date.submitted	2016-06-30	eng
dc.identifier.uri	https://hdl.handle.net/1956/12667
dc.description.abstract	This thesis considers a class of propositional boolean formulas on which various problems related to satisfiability are efficiently solvable by a dynamic programming algorithm. It mainly consists of two larger parts: the first part describes the class of boolean formulas we are interested in and how to find them, and the second part investigates whether this class of formulas have any practical implications.	en_US
dc.format.extent	3785397 bytes	eng
dc.format.mimetype	application/pdf	eng
dc.language.iso	eng	eng
dc.publisher	The University of Bergen	en_US
dc.title	Algorithms for Linearly Ordered Boolean Formulas	en_US
dc.type	Master thesis
dc.rights.holder	Copyright the Author. All rights reserved	en_US
dc.description.degree	Master i Informatikk	en_US
dc.description.localcode	MAMN-INF
dc.description.localcode	INF399
dc.subject.nus	754199	eng
fs.subjectcode	INF399