A Fast Symbolic Transformation Based Algorithm for Reversible Logic Synthesis (Q3186608): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-40578-0_22
+Normal rank
@@ Property / OpenAlex ID @@
+W2487095096
@@ Property / OpenAlex ID: W2487095096 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5503674
@@ Property / cites work: Q5503674 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph-Based Algorithms for Boolean Function Manipulation
+Normal rank
@@ Property / cites work @@
+Young subgroups for reversible computers.
@@ Property / cites work: Young subgroups for reversible computers. / rank @@
+Normal rank
@@ Property / cites work @@
+Blocked Clause Elimination
@@ Property / cites work: Blocked Clause Elimination / rank @@
+Normal rank
@@ Property / cites work @@
+A structure-preserving clause form translation
@@ Property / cites work: A structure-preserving clause form translation / rank @@
+Normal rank
@@ Property / cites work @@
+Towards an Optimal CNF Encoding of Boolean Cardinality Constraints
+Normal rank
@@ Property / cites work @@
+Ancilla-free synthesis of large reversible functions using binary decision diagrams
+Normal rank
@@ Property / cites work @@
+Q3171620
@@ Property / cites work: Q3171620 / rank @@
+Normal rank
@@ Property / cites work @@
+The size of reduced OBDD's and optimal read-once branching programs for almost all Boolean functions
+Normal rank