Abstract
Many important computational problems involve finding a maximal (with respect to set inclusion) solution in some combinatorial context. We study such maximality problems from the complexity point of view, and categorize their complexity precisely in terms of tight upper and lower bounds. Our results give characterizations of coNP, DP, ΠP2, FPNP||, FNP//OptP [log n] and FPΣP||2 in terms of subclasses of maximality problems. An important consequence of our results is that finding an X-minimal satisfying truth assignment for a given CNF boolean formula is complete for FNP//OptP[log n], solving an open question by Papadimitriou [Proceedings of the 32nd IEEE Symposium on the Foundations of Computer Science, 1991, pp. 163-169].
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
