More complicated questions about maxima and minima, and some closures of NP
Theoretical Computer Science
The complexity of optimization problems
Journal of Computer and System Sciences - Structure in Complexity Theory Conference, June 2-5, 1986
Generalizations of Opt P to the polynomial hierarchy
Theoretical Computer Science
A dichotomy theorem for maximum generalized satisfiability problems
Journal of Computer and System Sciences - Special issue on selected papers presented at the 24th annual ACM symposium on the theory of computing (STOC '92)
Complexity of generalized satisfiability counting problems
Information and Computation
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
Constraint Satisfaction: The Approximability of Minimization Problems
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
The Complexity of Minimal Satisfiability Problems
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Equivalence and Isomorphism for Boolean Constraint Satisfaction
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Generalized modal satisfiability
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
We consider the problems of finding the lexicographically minimal (or maximal) satisfying assignment of propositional formulas for different restricted classes of formulas. It turns out that for each class from our framework, these problems are either polynomial time solvable or complete for OptP.