Abstract

For a propositional proof system P we introduce the complexity class DNPP ( P ) of all disjoint NP -pairs for which the disjointness of the pair is efficiently provable in the proof system P . We exhibit structural properties of proof systems which make canonical NP -pairs associated with these proof systems hard or complete for DNPP ( P ) . Moreover, we demonstrate that non-equivalent proof systems can have equivalent canonical pairs and that depending on the properties of the proof systems different scenarios for DNPP ( P ) and the reductions between the canonical pairs exist.

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 call

Disclaimer: 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.