Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 -
2 of
2
Notes taken by Periklis Papakonstantinou revised by Hamed Hatami
"... Lecture 7: Lower bounds on the embeddability in via expander graphs and some algorithmic connections to ..."
Abstract
- Add to MetaCart
Lecture 7: Lower bounds on the embeddability in via expander graphs and some algorithmic connections to
CSC2414- Metric Embeddings
"... Lecture 7: Lower bounds on the embeddability in ¡£ ¢ via expander graphs and some algorithmic connections to ¡¥¤ Notes taken by Periklis Papakonstantinou revised by Hamed Hatami Summary: In view of Bourgain’s upper bound a central question in finite metric embeddings concerns explicit constructions ..."
Abstract
- Add to MetaCart
Lecture 7: Lower bounds on the embeddability in ¡£ ¢ via expander graphs and some algorithmic connections to ¡¥¤ Notes taken by Periklis Papakonstantinou revised by Hamed Hatami Summary: In view of Bourgain’s upper bound a central question in finite metric embeddings concerns explicit constructions
