The following pages link to (Q5111351):
Displaying 16 items.
- More on change-making and related problems (Q2051861) (← links)
- The fine-grained complexity of multi-dimensional ordering properties (Q2093566) (← links)
- Faster minimization of tardy processing time on a single machine (Q2134746) (← links)
- Tight conditional lower bounds for longest common increasing subsequence (Q2272597) (← links)
- (1+1) EA on Generalized Dynamic OneMax (Q2981881) (← links)
- Hamming Distance Completeness (Q5088904) (← links)
- The Orthogonal Vectors Conjecture for Branching Programs and Formulas (Q5090426) (← links)
- Fine-Grained Complexity Theory (Tutorial) (Q5090450) (← links)
- Fine-Grained Reductions and Quantum Speedups for Dynamic Programming. (Q5091156) (← links)
- (Q5091168) (← links)
- (Q5091235) (← links)
- (Q5111874) (← links)
- (Q5240419) (← links)
- (Q5874497) (← links)
- Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems (Q6181364) (← links)
- Computing generalized convolutions faster than brute force (Q6185947) (← links)
