The following pages link to Carlos Alberto Alonso Sanches (Q275219):
Displaying 9 items.
- A computational DNA solution approach for the quadratic Diophantine equation (Q275220) (← links)
- (Q852947) (redirect page) (← links)
- An optimal and scalable parallelization of the two-list algorithm for the subset-sum problem (Q852950) (← links)
- Parallel time and space upper-bounds for the subset-sum problem (Q955010) (← links)
- Observations on optimal parallelizations of two-list algorithm (Q991072) (← links)
- A polynomial-time DNA computing solution for the bin-packing problem (Q1039671) (← links)
- A low-space algorithm for the subset-sum problem on GPU (Q1652299) (← links)
- An improved balanced algorithm for the subset-sum problem (Q1713739) (← links)
- Comments on parallel algorithms for the knapsack problem. (Q1853236) (← links)
