Hacker News new | ask | show | jobs
by xorand 2348 days ago
Some trivial mathematical facts. No matter what algorithm you use, you want to make a quasiisometrical embedding of a tree into a finite dimensional space. Or, for a tree the no of nodes at distance R from the root is like exp R, but in any space of dimension N you can cram about R^N points which are at distance R from the origin. Hence the problem.

But you can embedd any tree into the Hilbert space :)