scientific article; zbMATH DE number 7691481

MaRDI QIDQ6160890zbMATH OpenFDO

Authors Guillaume Ducoffe

Publication date 2 June 2023

zbMATH Keywords

Boolean distanceintervals of graphsNP-hardnessSETH-hardnesstransit functions

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• A New Transform Related to Distance From a Boolean Function
• A Boolean measure of similarity
• scientific article; zbMATH DE number 7034406
• The Boolean map distance: theory and efficient computation
• A new transform related to distance from a Boolean function (extended abstract)
• Approximating the distance to monotonicity of Boolean functions
• Approximating the distance to monotonicity of Boolean functions
• scientific article; zbMATH DE number 937007
• Distance generated by a fuzzy compatibility
• On the Hamming distance between almost all Boolean functions

Cited in

(1)

• Leanness computation: small values and special graph classes

This page was built for publication:

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