Enumeration of Reversible Functions and Its Application to Circuit Complexity

Mathias Soeken, Nabila Abdessaied, Giovanni De Micheli. Enumeration of Reversible Functions and Its Application to Circuit Complexity. In Simon J. Devitt, Ivan Lanese, editors, Reversible Computation - 8th International Conference, RC 2016, Bologna, Italy, July 7-8, 2016, Proceedings. Volume 9720 of Lecture Notes in Computer Science, pages 255-270, Springer, 2016. [doi]

@inproceedings{SoekenAM16,
  title = {Enumeration of Reversible Functions and Its Application to Circuit Complexity},
  author = {Mathias Soeken and Nabila Abdessaied and Giovanni De Micheli},
  year = {2016},
  doi = {10.1007/978-3-319-40578-0_19},
  url = {http://dx.doi.org/10.1007/978-3-319-40578-0_19},
  researchr = {https://researchr.org/publication/SoekenAM16},
  cites = {0},
  citedby = {0},
  pages = {255-270},
  booktitle = {Reversible Computation - 8th International Conference, RC 2016, Bologna, Italy, July 7-8, 2016, Proceedings},
  editor = {Simon J. Devitt and Ivan Lanese},
  volume = {9720},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-40577-3},
}