Old Web
English
Sign In
Acemap
>
Paper
>
Hardness of almost embedding simplicial complexes in R d .
Hardness of almost embedding simplicial complexes in R d .
2017
Arkadiy Skopenkov
Martin Tancer
Keywords:
Embedding
Combinatorics
Mathematics
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
8
Citations
NaN
KQI
[]