Graph Transformation Meets Reversible Circuits: Generation, Evaluation, and Synthesis

Kreowski, Hans‐Jörg; Kuske, Sabine; Lye, Aaron; Luderer, Melanie

doi:10.1007/978-3-319-09108-2_16

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2016

2022

Publication Types

Select...

Article1

Book1

Relationship

Self Cite0

Independent2

Authors

Journals

Cited by 2 publications

(1 citation statement)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [13], we have shown that moving preserves the spine and provided all the prerequisites for the category of directed edge-labeled graphs. To define the accessed part of a derivation and the restriction of a derivation and to prove the needed results for restrictions and the main theorem, we have made heavy use of set-theoretical constructs like subgraphs, intersections, unions and the constructions of pushout complements and derived graphs by employing the difference of sets.…”

Section: Introductionmentioning

confidence: 96%

A Graph-Transformational Approach for Proving the Correctness of Reductions between NP-Problems

Kreowski

Kuske

Lye

et al. 2022

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

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.

show abstract

Section: Introductionmentioning

confidence: 96%