520 citations · 2.5k across the 46 of their papers we have counts for
1 paper · 1 filter
Stephen P. Jordan
It is well-known that deciding equivalence of logic circuits is a coNP-complete problem. As a corollary, the problem of deciding weak equivalence of reversible circuits, i.e. ignor…