Abstract
A generalized split (k,l) partition is a vertex set partition into at most k independent sets and l cliques. We prove that the (2, 1) partitioned probe problem is in P whereas the (2, 2) partitioned probe is NP-complete. The full complexity dichotomy into polynomial time and NP-complete for the class of generalized split partitioned probe problems establishes (2, 2) as the first NP-complete self-complementary partitioned probe problem, and answers negatively the PGC conjecture by finding a polynomial time recognition problem whose partitioned probe version is NP-complete.
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.
