Pages that link to "Item:Q4326851"
From MaRDI portal
The following pages link to Tighter Lower Bounds on the Exact Complexity of String Matching (Q4326851):
Displaying 8 items.
- Tight comparison bounds for the string prefix-matching problem (Q685487) (← links)
- Light-based string matching (Q835975) (← links)
- A simple fast hybrid pattern-matching algorithm (Q925062) (← links)
- The complexity of mean payoff games on graphs (Q1351468) (← links)
- (Q4228434) (← links)
- On the lower bound for parallel string matching (Q4844575) (← links)
- (Q4929407) (← links)
- The complexity of mean payoff games (Q6064008) (← links)