The square tiling problem is NP-complete for deterministic tile sets

The square tiling problem is NP-complete for deterministic tile sets

datePublished

• 2006

description

• kuvitettu

identifier

• propertyID: FI-FENNI value: 826837
• propertyID: FI-MELINDA value: 000411586
• propertyID: FI-MELINDA value: 005145215
• propertyID: skl value: fx826837

isbn

• 9521216980

isPartOf

• Fennica
• TUCS technical report, 1239-1891

name

• The square tiling problem is NP-complete for deterministic tile sets

numberOfPages

• 9, [2] s.

P60048

• <http://rdaregistry.info/termList/RDACarrierType/1049>

P60050

• <http://rdaregistry.info/termList/RDAMediaType/1007>

publication

• location: Turku organizer: Turun tietotekniikan tutkimus- ja koulutuskeskus

publisher

• Turun tietotekniikan tutkimus- ja koulutuskeskus