Pages that link to "Item:Q5111349"
From MaRDI portal
The following pages link to Approximating Language Edit Distance Beyond Fast Matrix Multiplication: Ultralinear Grammars Are Where Parsing Becomes Hard! (Q5111349):
Displaying 4 items.
- A linear-time simulation of deterministic \(d\)-limited automata (Q832958) (← links)
- If the Current Clique Algorithms Are Optimal, so Is Valiant's Parser (Q4562283) (← links)
- Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product (Q4634027) (← links)
- Absent Subsequences in Words (Q6070611) (← links)