Pages that link to "Item:Q2118211"
From MaRDI portal
The following pages link to On the complexity of recognizing Wheeler graphs (Q2118211):
Displayed 3 items.
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q831852) (← links)
- On the Hardness and Inapproximability of Recognizing Wheeler Graphs (Q5075794) (← links)
- Quantum time complexity and algorithms for pattern matching on labeled graphs (Q6111593) (← links)