Pages that link to "Item:Q5466513"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5466513):
Displaying 19 items.
- Approximate pattern matching with the \(L_1\), \(L_2\) and \(L_\infty\) metrics (Q534777) (← links)
- Efficient computations of \(\ell _1\) and \(\ell _{\infty }\) rearrangement distances (Q732031) (← links)
- Approximate \(k\)-closest-pairs in large high-dimensional data sets (Q814957) (← links)
- Approximate closest-point queries in high dimensions (Q1209329) (← links)
- Two-dimensional closest pair problem: a closer look (Q2004080) (← links)
- On closest pair in Euclidean metric: monochromatic is as hard as bichromatic (Q2221003) (← links)
- Approximate matching in the \(L_{\infty }\) metric (Q2380061) (← links)
- \(L_{1}\) pattern matching lower bound (Q2380062) (← links)
- Reductions among high dimensional proximity problems (Q2768379) (← links)
- Reporting neighbors in high-dimensional Euclidean space (Q2929701) (← links)
- On the Complexity of Closest Pair via Polar-Pair of Point-Sets (Q3122310) (← links)
- Brief Announcement: Hamming Distance Completeness and Sparse Matrix Multiplication. (Q5002794) (← links)
- Dynamic closest pairs — A probabilistic approach (Q5056153) (← links)
- Hamming Distance Completeness (Q5088904) (← links)
- On Closest Pair in Euclidean Metric: Monochromatic is as Hard as Bichromatic (Q5090390) (← links)
- On the Complexity of Closest Pair via Polar-Pair of Point-Sets (Q5115796) (← links)
- Dominance Product and High-Dimensional Closest Pair under L_infty (Q5136258) (← links)
- The Closest Pair Problem under the Hamming Metric (Q5323065) (← links)
- (Q5743411) (← links)
