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 ...
"explanation": "This problem requires partitioning an array of integers into K non-empty subsets such that each subset has the same sum. The brute force backtracking approach explores all possible ...
Abstract: A novel completely mode-free integral reinforcement learning (CMFIRL)-based iteration algorithm is proposed in this article to compute the two-player zero-sum games and the Nash equilibrium ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results