arXiv Open Access 2016

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

Peter Selinger

Lihat Sumber

Abstrak

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.

Topik & Kata Kunci

cs.ET math.RA quant-ph

Penulis (1)

Peter Selinger

Format Sitasi

APA MLA BibTeX

Selinger, P. (2016). Reversible k-valued logic circuits are finitely generated for odd k. https://arxiv.org/abs/1604.01646

Akses Cepat

Lihat di Sumber

Informasi Jurnal

Tahun Terbit: 2016
Bahasa: en
Sumber Database: arXiv
Akses: Open Access ✓