Showing cs.DMShow all
2 papers · 1 filter
cs.DM2026
Counting and Covering in Nearest-Neighbour Representations of Boolean Functions
Martin Anthony
We study the number of prototypes needed to represent Boolean functions by nearest-neighbour classification. There are two distinct settings: the prototypes may be arbitrary points…
cs.DM2026
Chamber geometry and specification numbers of Boolean threshold functions
Martin Anthony
The specification number of a Boolean threshold function on variables is the least number of points whose -values determine uniquely among all threshold fun…