BORA - UiBBORA
    • English
    • norsk
  • English 
    • English
    • norsk
  • Login
View Item 
  •   BORA Home
  • Faculty of Mathematics and Natural Sciences
  • Department of Informatics
  • Department of Informatics
  • View Item
  •   BORA Home
  • Faculty of Mathematics and Natural Sciences
  • Department of Informatics
  • Department of Informatics
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Algorithms for Linearly Ordered Boolean Formulas

Type
Master thesis
Not peer reviewed
Thumbnail
View/Open
147336902.pdf (3.610Mb)
Date
2016-06-30
Author
Egeland, Christian
Share

Metadata
Show full item record
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.
URI
http://hdl.handle.net/1956/12667
Publisher
The University of Bergen
Collections
  • Department of Informatics 398
Copyright the Author. All rights reserved

University of Bergen Library
Contact Us | Send Feedback
 

 

Browse

All of BORACommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsTypeThis CollectionBy Issue DateAuthorsTitlesSubjectsType

My Account

LoginRegister

Statistics

View Usage Statistics

University of Bergen Library
Contact Us | Send Feedback