The following pages link to (Q2934692):
Displaying 12 items.
- Parsing by matrix multiplication generalized to Boolean grammars (Q385966) (← links)
- The Mailman algorithm: a note on matrix-vector multiplication (Q976066) (← links)
- Fast algorithms with preprocessing for matrix-vector multiplication problems (Q1342512) (← links)
- Improved normal form for grammars with one-sided contexts (Q2348260) (← links)
- Logic minimization techniques with applications to cryptology (Q2377070) (← links)
- Orthogonal range searching in moderate dimensions: k-d trees and range trees strike back (Q2415385) (← links)
- Pushing the online Boolean matrix-vector multiplication conjecture off-line and identifying its easy cases (Q2656173) (← links)
- Faster Algorithms for Weighted Recursive State Machines (Q2988644) (← links)
- Edit Distance with Duplications and Contractions Revisited (Q3011874) (← links)
- (Q3711657) (← links)
- Sketching with Kerdock's Crayons: Fast Sparsifying Transforms for Arbitrary Linear Maps (Q5088658) (← links)
- A Sparsified Four-Russian Algorithm for RNA Folding (Q5283833) (← links)
