The following pages link to (Q2712370):
Displaying 6 items.
- Exact and approximation algorithms for computing optimal fat decompositions (Q598551) (← links)
- Partitioning procedure for polynomial optimization (Q604960) (← links)
- Positive half-products and scheduling with controllable processing times (Q1772845) (← links)
- Multilevel polynomial partitions and simplified range searching (Q2354673) (← links)
- Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps (Q2953793) (← links)
- Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines (Q4578168) (← links)