Pages that link to "Item:Q3543477"
From MaRDI portal
The following pages link to Solving satisfiability in the tile assembly model with a constant-size tileset (Q3543477):
Displaying 9 items.
- A manually-checkable proof for the NP-hardness of 11-color pattern self-assembly tileset synthesis (Q511695) (← links)
- Solving NP-complete problems in the tile assembly model (Q924678) (← 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)
- Efficient 3-SAT algorithms in the tile assembly model (Q2629931) (← links)
- Generalized Gandy-Păun-Rozenberg Machines for Tile Systems and Cellular Automata (Q2890298) (← links)
- Improving Efficiency of 3-SAT-Solving Tile Systems (Q3070958) (← links)
- The non-cooperative tile assembly model is not intrinsically universal or capable of bounded Turing machine simulation (Q4977983) (← links)