A Graph-Transformational Approach for Proving the Correctness of Reductions between NP-Problems
Computational Complexity
2022-12-23 v1
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.
Cite
@article{arxiv.2212.11627,
title = {A Graph-Transformational Approach for Proving the Correctness of Reductions between NP-Problems},
author = {Hans-Jörg Kreowski and Sabine Kuske and Aaron Lye and Aljoscha Windhorst},
journal= {arXiv preprint arXiv:2212.11627},
year = {2022}
}
Comments
In Proceedings GCM 2022, arXiv:2212.10975