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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 3 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
Property / cites work
 
Property / cites work: Amplifying lower bounds by means of self-reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. I: Discharging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. II: Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost-natural proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthesizing minimal tile sets for complex patterns in the framework of patterned DNA self-assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search methods for tile sets in patterned DNA self-assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2878076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Minimum Tile Sets to Self-Assemble Color Patterns / rank
 
Normal rank
Property / cites work
 
Property / cites work: A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary pattern tile set synthesis is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-color bounded patterned self-assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SAT Attack on the Erdős Discrepancy Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-weight triangulation is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4340879 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization in Pattern Assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 24th Mersenne Prime / rank
 
Normal rank
Property / cites work
 
Property / cites work: One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Two-Handed Tile Assembly Model Is Not Intrinsically Universal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intrinsic Universality in Self-Assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Study of the Kepler's conjecture: the problem of the closest packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2756729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-Color Bounded Patterned Self-assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability and complexity in self-assembly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intrinsic universality in tile self-assembly requires cooperation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-assembly of decidable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer solution to the 17-point Erdős-Szekeres problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4992866 / rank
 
Normal rank

Latest revision as of 18:39, 13 July 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
11 May 2017
0 references
27 October 2015
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
0 references
0 references
0 references
0 references
0 references
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references