Pages that link to "Item:Q5165610"
From MaRDI portal
The following pages link to On Hardness of Several String Indexing Problems (Q5165610):
Displaying 9 items.
- Fast set intersection and two-patterns matching (Q708235) (← links)
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q831852) (← links)
- Space-efficient indexes for forbidden extension queries (Q1632508) (← links)
- Ranked document retrieval for multiple patterns (Q1784746) (← links)
- On hardness of several string indexing problems (Q2342674) (← links)
- Ranked Document Retrieval with Forbidden Pattern (Q2942247) (← links)
- Compact Indexes for Flexible Top-$$k$$ Retrieval (Q2942258) (← links)
- Time-Optimal Top-$k$ Document Retrieval (Q2963583) (← links)
- On the Cost of Interchange Rearrangement in Strings (Q5900366) (← links)