The Boolean map distance: theory and efficient computation

DOI10.1007/978-3-319-66272-5_27MaRDI QIDQ1690418zbMATH OpenOpenAlexFDO

Authors Filip Malmberg, Robin Strand, Jianming Zhang, Stan Sclaroff

Publication date 19 January 2018

Full work available at URL https://hdl.handle.net/2144/26693

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Recommendations

• On the Hamming distance between almost all Boolean functions
• scientific article; zbMATH DE number 7034406
• A new transform related to distance from a Boolean function (extended abstract)
• A unified linear-time algorithm for computing distance maps
• Approximating the distance to monotonicity of Boolean functions
• Approximating the distance to monotonicity of Boolean functions
• Improved upper bound for the relative distance between a Boolean function and the set of \(k\)-dimensional functions
• On the complexity of computing the Hausdorff distance
• scientific article; zbMATH DE number 2058394
• Efficient distance computation in configuration space

Cited in

(3)

• scientific article; zbMATH DE number 7691481 (Why is no real title available?)
• scientific article; zbMATH DE number 7034406 (Why is no real title available?)
• Introducing the Dahu pseudo-distance

This page was built for publication: The Boolean map distance: theory and efficient computation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1690418)