Pages that link to "Item:Q831852"

The following pages link to Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q831852):

Displayed 8 items.

• Wheeler languages (Q2051845) ‎ (← links)
• Solving string problems on graphs using the labeled direct product (Q2088591) ‎ (← links)
• Linear time construction of indexable elastic founder graphs (Q2169983) ‎ (← links)
• On the Complexity of String Matching for Graphs (Q6075757) ‎ (← 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)