Paper Info

Title | ||
---|---|---|

Reversible k-valued logic circuits are finitely generated for odd k. |

Abstract | ||
---|---|---|

In his 2003 paper Towards an algebraic theory of Boolean circuits, Lafont notes that the class of reversible circuits over a set of k truth values is finitely generated when k is odd. He cites a private communication for the proof. The purpose of this short note is to make the content of that communication available. |

Year | Venue | Field |
---|---|---|

2016 | arXiv: Emerging Technologies | Discrete mathematics,Boolean circuit,Logic gate,Finitely-generated abelian group,Computer science,Truth value,Algorithm,Theoretical computer science,Algebraic theory,Electronic circuit |

DocType | Volume | Citations |

Journal | abs/1604.01646 | 0 |

PageRank | References | Authors |

0.34 | 1 | 1 |

Authors (1 rows)

Cited by (0 rows)

References (1 rows)

Name | Order | Citations | PageRank |
---|---|---|---|

Peter Selinger | 1 | 434 | 36.65 |