The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae
Computational Complexity
2007-05-23 v1
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.
Cite
@article{arxiv.cs/9809116,
title = {The Complexity of Computing Optimal Assignments of Generalized Propositional Formulae},
author = {Steffen Reith and Heribert Vollmer},
journal= {arXiv preprint arXiv:cs/9809116},
year = {2007}
}
Comments
17 pages, 1 figure