A Graph-Transformational Approach for Proving the Correctness of Reductions between NP-Problems
Hans-J\"org Kreowski (University of Bremen), Sabine Kuske (University, of Bremen), Aaron Lye (University of Bremen), Aljoscha Windhorst (University, of Bremen)
TL;DR
This paper introduces a graph-transformational method to verify the correctness of polynomial-time reductions between NP problems, emphasizing graph-based problem representations.
Contribution
It presents a novel graph-transformational approach specifically designed for proving the correctness of reductions between NP problems.
Findings
The approach effectively verifies reductions between graph-based NP problems.
It offers a systematic method for correctness proofs in NP reductions.
The method enhances understanding of problem transformations in computational complexity.
Abstract
The complexity class NP of decision problems that can be solved nondeterministically in polynomial time is of great theoretical and practical importance where the notion of polynomial-time reductions between NP-problems is a key concept for the study of NP. As many typical NP-problems are naturally described as graph problems, they and their reductions are obvious candidates to be investigated by graph-transformational means. In this paper, we propose such a graph-transformational approach for proving the correctness of reductions between NP-problems.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.