1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.CC2025
Determining unit distance graphs with coordinates in is NP-complete
Eric Binnendyk
The problem of determining whether a graph can be realized as a unit-distance graph in is NP-complete. As far as we can tell, a proof of this result has never be…
cs.LG2021★ 1 cited
Learning with distributional inverters
Eric Binnendyk, Marco Carmosino, Antonina Kolokolova +2
We generalize the "indirect learning" technique of Furst et. al., 1991 to reduce from learning a concept class over a samplable distribution to learning the same concept class…