Binary pattern tile set synthesis is NP-hard (Q527409): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Merged Item from Q3448857
 
(3 intermediate revisions by 2 users not shown)
aliases / en / 0aliases / en / 0
 
Binary Pattern Tile Set Synthesis Is NP-hard
description / endescription / en
scientific article
scientific article; zbMATH DE number 6498710
Property / title
 
Binary Pattern Tile Set Synthesis Is NP-hard (English)
Property / title: Binary Pattern Tile Set Synthesis Is NP-hard (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1370.68108 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-662-47672-7_83 / rank
 
Normal rank
Property / published in
 
Property / published in: Automata, Languages, and Programming / rank
 
Normal rank
Property / publication date
 
27 October 2015
Timestamp+2015-10-27T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 27 October 2015 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6498710 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2595528477 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1404.0967 / rank
 
Normal rank

Latest revision as of 14:15, 29 April 2024

scientific article; zbMATH DE number 6498710
  • Binary Pattern Tile Set Synthesis Is NP-hard
Language Label Description Also known as
English
Binary pattern tile set synthesis is NP-hard
scientific article; zbMATH DE number 6498710
  • Binary Pattern Tile Set Synthesis Is NP-hard

Statements

Binary pattern tile set synthesis is NP-hard (English)
0 references
Binary Pattern Tile Set Synthesis Is NP-hard (English)
0 references
0 references
0 references
0 references
0 references
0 references
0 references
11 May 2017
0 references
27 October 2015
0 references
0 references
0 references
0 references
0 references
0 references
0 references
algorithmic DNA self-assembly
0 references
pattern assembly
0 references
NP-hardness
0 references
computer-assisted proof
0 references
massively-parallelized program
0 references
0 references
0 references
0 references