Does anyone know a test that could decide if a given subset of the vertex of a binary hypercube is linearly separable from the rest of the set. We are looking for criteria in the sense of Hamming distance, connectivity , etc. instead of an iterative algorithm (perceptrons already do) Thanks