John Caughman

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
This paper presents a synthesis algorithm, Covering Set Partitions (CSP), for reversible binary functions with no ancillary (garbage) bits. Existing algorithms are constrained to functions of small number of variables because they store the entire truth table of 2 n terms in memory or require a huge amount of time to yield results because they must(More)
  • 1