Nearest Neighbor Complexity and Boolean Circuits
Nearest Neighbor Complexity and Boolean Circuits
A nearest neighbor representation of a Boolean function $f$ is a set of vectors (anchors) labeled by $0$ or $1$ such that $f(\vec{x}) = 1$ if and only if the closest anchor to $x$ is labeled by $1$. This model was introduced by Hajnal, Liu, and Tur\'an (2022), who studied …