Pages that link to "Item:Q5236184"
From MaRDI portal
The following pages link to SETH-Based Lower Bounds for Subset Sum and Bicriteria Path (Q5236184):
Displaying 16 items.
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory (Q2055649) (← links)
- Scheduling lower bounds via AND subset sum (Q2121467) (← links)
- Faster minimization of tardy processing time on a single machine (Q2134746) (← links)
- Approximating subset sum ratio via subset sum computations (Q2169941) (← links)
- Faster Pseudopolynomial Time Algorithms for Subset Sum (Q4972686) (← links)
- Quantum Hardness of Learning Shallow Classical Circuits (Q4994987) (← links)
- (Q5075820) (← links)
- On Integer Programming and Convolution. (Q5090420) (← links)
- Fine-Grained Complexity Theory (Tutorial) (Q5090450) (← links)
- (Q5090494) (← links)
- (Q5090495) (← links)
- Fine-Grained Reductions and Quantum Speedups for Dynamic Programming. (Q5091156) (← links)
- The Fine-Grained Complexity of Median and Center String Problems Under Edit Distance (Q5874533) (← links)
- Algebraic algorithms for variants of subset sum (Q6102280) (← links)
- Column-coherent matrix decomposition (Q6535177) (← links)
- \(k\)-SUM in the sparse regime: complexity and applications (Q6648210) (← links)