Department of Engineering Technology, Savannah State University, Savannah, GA, USA. Our analysis reveals that most claimed applications of Grover’s algorithm fall into one of several categories: Those ...

ABSTRACT: In this paper, we investigate the convergence of the generalized Bregman alternating direction method of multipliers (ADMM) for solving nonconvex separable problems with linear constraints.

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 ...

// 剪定二：startから走査を開始し、重複する部分集合の生成を回避 // 剪定三：startから走査を開始し、同じ要素の繰り返し選択を回避 for (int i = start; i < choices.length; i++) { // 剪定一：部分集合の和がtargetを超えた場合、即座にループを終了 // 配列がソートされ ...

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 ...

Abstract: DNA computing is a new emerging field of parallel computing. However, DNA computing is mainly based on biological technology, which is prone to deterioration and damage and other issues in ...