2 papers
cs.CC2019
On the Approximability of Presidential Type Predicates
Neng Huang, Aaron Potechin
Given a predicate , let be the set of constraint satisfaction problems whose constraints are of the form . We say that is approximable…
cs.SI2018
The idemetric property: when most distances are (almost) the same
George Barmpalias, Neng Huang, Andrew Lewis-Pye +4
We introduce the \emph{idemetric} property, which formalises the idea that most nodes in a graph have similar distances between them, and which turns out to be quite standard among…