A Walsh Analysis of NK-Landscapes.
Robert B. Heckendorn, L. Darrell Whitley · 1997
We use Walsh analysis to show NKLandscapes form an extremely restricted set of functions out of the set of N bit functions that have interactions between K+1 or fewer bits. Several upper bounds on the extent of the coverage by NK-Landscapes are created based on theory developed in the paper.