"Binary Pattern Tile Set Synthesis Is NP-Hard."

Lila Kari et al. (2017)

> Home

Details and statistics

DOI: 10.1007/S00453-016-0154-7

access: closed

type: Journal Article

metadata version: 2023-06-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/KariKMPS17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/KariKMPS17
Lila Kari, Steffen Kopecki, Pierre-Étienne Meunier, Matthew J. Patitz, Shinnosuke Seki:
Binary Pattern Tile Set Synthesis Is NP-Hard. Algorithmica 78(1): 1-46 (2017)

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.