Pages that link to "Item:Q517795"
From MaRDI portal
The following pages link to Necklaces, convolutions, and \(X+Y\) (Q517795):
Displaying 15 items.
- Efficient indexes for jumbled pattern matching with constant-sized alphabet (Q524375) (← links)
- Extreme witnesses and their applications (Q1799232) (← links)
- Smallest \(k\)-enclosing rectangle revisited (Q2046452) (← links)
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance (Q2408191) (← links)
- Subquadratic algorithms for algebraic 3SUM (Q2415376) (← links)
- Bounds for Semi-disjoint Bilinear Forms in a Unit-Cost Computational Model (Q2988839) (← links)
- Faster All-Pairs Shortest Paths via Circuit Complexity (Q4554074) (← links)
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) (← links)
- From Circuit Complexity to Faster All-Pairs Shortest Paths (Q5009891) (← links)
- Smallest k-enclosing rectangle revisited (Q5088950) (← links)
- On Integer Programming and Convolution. (Q5090420) (← links)
- (Q5091235) (← links)
- (Q5240419) (← links)
- Derivative-free mixed binary necklace optimization for cyclic-symmetry optimal design problems (Q6159484) (← links)
- Improved Merlin-Arthur protocols for central problems in fine-grained complexity (Q6174820) (← links)
