Embedding into ::::l::::::infinity:::::2::: Is Easy, Embedding into ::::l:::: ::infinity:::::3::: Is NP-Complete

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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.