Jeff Edmonds. Embedding into ::::l::::::infinity:::::2::: Is Easy, Embedding into ::::l:::: ::infinity:::::3::: Is NP-Complete. Discrete & Computational Geometry, 39(4):747-765, 2008. [doi]
@article{Edmonds08,
title = {Embedding into ::::l::::::infinity:::::2::: Is Easy, Embedding into ::::l:::: ::infinity:::::3::: Is NP-Complete},
author = {Jeff Edmonds},
year = {2008},
doi = {10.1007/s00454-008-9064-z},
url = {http://dx.doi.org/10.1007/s00454-008-9064-z},
tags = {completeness},
researchr = {https://researchr.org/publication/Edmonds08},
cites = {0},
citedby = {0},
journal = {Discrete & Computational Geometry},
volume = {39},
number = {4},
pages = {747-765},
}