arXiv · cs/9809116
The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae
Abstract
We consider the problems of finding the lexicographically minimal (or maximal) satisfying assignment of propositional formulae for different restricted formula classes. It turns out that for each class from our framework, the above problem is either polynomial time solvable or complete for OptP. We also consider the problem of deciding if in the optimal assignment the largest variable gets value 1. We show that this problem is either in P or P^NP complete.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Steffen Reith, Heribert Vollmer. 1998-09-28. The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae. https://searcharxiv.com/abs/cs/9809116
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.