Pages that link to "Item:Q924676"
From MaRDI portal
The following pages link to Nondeterministic polynomial time factoring in the tile assembly model (Q924676):
Displaying 8 items.
- Arithmetic computation in the tile assembly model: addition and multiplication (Q884443) (← links)
- Solving NP-complete problems in the tile assembly model (Q924678) (← links)
- Path finding in the tile assembly model (Q1008725) (← links)
- Efficient 3-SAT algorithms in the tile assembly model (Q2629931) (← 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)