Quadratic assignment problems (QAPs) with a Hamming distance matrix for a hypercube or a Manhattan distance matrix for a rectangular grid arise frequently from communications and ...
Given a string x and a language L, the Hamming distance of x to L is the minimum Hamming distance of x to any string in L. The edit distance of a string to a language is analogous...
The generation of a set of rules underlying a classification problem is performed by applying a new algorithm, called Hamming Clustering (HC). It reconstructs the and-or expressio...
We study the simultaneous message passing model of communication complexity. Building on the quantum fingerprinting protocol of Buhrman et al., Yao recently showed that a large cl...
We investigate the computational complexity of finding an element of a permutation group H Sn with a minimal distance to a given Sn, for different metrics on Sn. We assume that...