The following pages link to Pattern matching in hypertext (Q5096935):
Displaying 5 items.
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q831852) (← links)
- Improved approximate pattern matching on hypertext (Q1566744) (← links)
- (Q4952706) (← links)
- Order Preserving Pattern Matching on Trees and DAGs (Q5150939) (← links)
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q6076352) (← links)