Canonical computation without canonical representation
Alan Mishchenko, Robert K. Brayton, Ana Petkovska, Mathias Soeken, Luca Amarù, Antun Domic · 2018
A representation of a Boolean function is canonical if, given a variable order, only one instance of the representation is possible for the function. A computation is canonical if the result depends only on the Boolean function and a variable order, and does not depend on how the function is represented and how the computation is implemented.