"Computational Complexity of Flattening Fixed-Angle Orthogonal Chains."

Erik D. Demaine et al. (2022)

> Home

Details and statistics

DOI: 10.48550/ARXIV.2212.12450

access: open

type: Informal or Other Publication

metadata version: 2023-01-04

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2212-12450
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2212-12450
Erik D. Demaine, Hiro Ito, Jayson Lynch, Ryuhei Uehara:
Computational Complexity of Flattening Fixed-Angle Orthogonal Chains. CoRR abs/2212.12450 (2022)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.