The following pages link to (Q5091210):
Displaying 7 items.
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q831852) (← links)
- The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance (Q5874533) (← links)
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q6076352) (← links)
- Algorithms and complexity on indexing founder graphs (Q6103519) (← links)
- Fine-Grained Complexity of Regular Path Queries (Q6137832) (← links)
- Elastic founder graphs improved and enhanced (Q6199393) (← links)
- Linear time construction of indexable founder block graphs (Q6487631) (← links)
