Pages that link to "Item:Q1810861"
From MaRDI portal
The following pages link to Center and distinguisher for strings with unbounded alphabet (Q1810861):
Displaying 3 items.
- Alphabet indexing for approximating features of symbols (Q1274598) (← links)
- A heuristic algorithm based on Lagrangian relaxation for the closest string problem (Q1762029) (← links)
- A combined<i>greedy-walk</i>heuristic and simulated annealing approach for the closest string problem (Q2926047) (← links)