Efficient computation of approximate isomorphisms between Boolean functions

Open Webpage

Hans Ulrich Simon

Published: 2016, Last Modified: 01 Jul 2024Inf. Process. Lett. 2016EveryoneRevisionsBibTeXCC BY-SA 4.0
Abstract: Highlights•A new algorithm for the construction of approximate ismorphisms between Boolean functions.•Improvement on an existing algorithm in several respects.•Efficiency: it works in polynomial time.•Performance: better performance guarantees as before.