Efficient computation of approximate isomorphisms between Boolean functions

DOI10.1016/j.ipl.2015.11.009zbMath1347.68187OpenAlexW2188798973MaRDI QIDQ903194

Hans Ulrich Simon

Publication date: 5 January 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.11.009

zbMATH Keywords

Boolean functionsanalysis of algorithmsapproximation algorithmsrandomized algorithmsisomorphism problem

Mathematics Subject Classification ID

Cites Work

• Isomorphism testing of Boolean functions computable by constant-depth circuits
• The Formula Isomorphism Problem
• Probability Inequalities for Sums of Bounded Random Variables
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

This page was built for publication: Efficient computation of approximate isomorphisms between Boolean functions