Timeline for Approximating distance on a finite graph with Hamming distance
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 22 at 3:41 | history | bounty ended | David Gao | ||
| Mar 22 at 3:41 | vote | accept | David Gao | ||
| Mar 13 at 18:47 | comment | added | David Gao | I see, this certainly put a severe constraint on what can be achieved without some bounds on the size of the vertex set. Thank you for the reference! Since there’s still a possibility that the error allowed at distance $N$ might salvage the problem, I’m going to leave this open for a few more days. In the meantime, I’m going to study the paper you mentioned. If no conclusive answer emerges in the next few days I’ll accept this as the answer. Thanks again! | |
| Mar 13 at 14:27 | history | answered | Daniel Weber | CC BY-SA 4.0 |