Pages that link to "Item:Q924678"
From MaRDI portal
The following pages link to Solving NP-complete problems in the tile assembly model (Q924678):
Displaying 16 items.
- An introduction to tile-based self-assembly and a survey of recent results (Q256961) (← links)
- A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis (Q511695) (← links)
- Binary pattern tile set synthesis is NP-hard (Q527409) (← links)
- Arithmetic computation in the tile assembly model: addition and multiplication (Q884443) (← links)
- Nondeterministic polynomial time factoring in the tile assembly model (Q924676) (← links)
- Path finding in the tile assembly model (Q1008725) (← links)
- Solving vertex cover problem using DNA tile assembly model (Q1789891) (← links)
- Nearly constant tile complexity for any shape in two-handed tile assembly (Q1999963) (← links)
- \(\mathsf{NP}\)-completeness of the game Kingdomino\(^\text{TM}\) (Q2182309) (← links)
- Efficient 3-SAT algorithms in the tile assembly model (Q2629931) (← links)
- Strategies to scan pictures with automata based on Wang tiles (Q3006164) (← links)
- Improving Efficiency of 3-SAT-Solving Tile Systems (Q3070958) (← links)
- Tile Complexity of Linear Assemblies (Q3143302) (← links)
- Solving satisfiability in the tile assembly model with a constant-size tileset (Q3543477) (← links)
- The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation (Q4977983) (← links)
- The Two-Handed Tile Assembly Model Is Not Intrinsically Universal (Q5326578) (← links)
