Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > NEAREST NEIGHBOR REPRESENTATION:
Reports tagged with nearest neighbor representation:
TR24-025 | 13th February 2024
Mason DiCicco, Vladimir Podolskii, Daniel Reichman

Nearest Neighbor Complexity and Boolean Circuits

Revisions: 1

A nearest neighbor representation of a Boolean function $f$ is a set of vectors (anchors) labeled by $0$ or $1$ such that $f(x) = 1$ if and only if the closest anchor to $x$ is labeled by $1$. This model was introduced by Hajnal, Liu, and TurĂ¡n (2022), who studied ... more >>>




ISSN 1433-8092 | Imprint