Hardness of embedding simplicial complexes in ::::R:::::::d:::

JirĂ­ Matousek, Martin Tancer, Uli Wagner. Hardness of embedding simplicial complexes in ::::R:::::::d:::. In Claire Mathieu, editor, Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6, 2009. pages 855-864, SIAM, 2009. [doi]

Abstract

Abstract is missing.