Now showing items 1-1 of 1

    • Convexity and logical analysis of data 

      Ekin, O.; Hammer, P. L.; Kogan, A. (Elsevier, 2000)
      A Boolean function is called k-convex if for any pair x,y of its true points at Hamming distance at most k, every point "between" x and y is also true. Given a set of true points and a set of false points, the central ...