The Meet in the Middle approach is an optimization technique for solving problems like the Subset Sum Problem, particularly when n is around 30–40. It reduces time complexity from O(2ⁿ) to O(2ⁿ/²), ...

Abstract: In this paper, security mechanism called zero knowledge proofs has been defined using subset sum problem. We have used subset sum problem for robustness analysis of zero-knowledge proofs ...

ABSTRACT: Soil-water characteristic curve (SWCC) is significant to estimate the site-specific unsaturated soil properties (such as unsaturated shear strength and coefficient of permeability) for ...

Solving the popular NP problem, The Subset Sum Problem, with an Amortized O(n) algorithm based on Recursive Backtracking. The Algorithm stood second fastest in the organized Intra-University ...