scholarly journals The Subset Sum Problem: Reducing Time Complexity of NP-Completeness with Quantum Search

2013 ◽  
Vol 4 (2) ◽  
Author(s):  
Bo Moon
Keyword(s):  
Time Complexity ◽  
Quantum Search ◽  
Subset Sum Problem ◽  
Np Completeness ◽  
Subset Sum

scholarly journals On subset sum problem in branch groups

2020 ◽  
Vol Volume 12, issue 1 ◽  
Author(s):  
Andrey Nikolaev ◽  
Alexander Ushakov
Keyword(s):  
Final Version ◽  
Subset Sum Problem ◽  
Grigorchuk Group ◽  
Np Completeness ◽  
Subset Sum ◽  
Np Complete ◽  
Np Hardness

We consider a group-theoretic analogue of the classic subset sum problem. In this brief note, we show that the subset sum problem is NP-complete in the first Grigorchuk group. More generally, we show NP-hardness of that problem in weakly regular branch groups, which implies NP-completeness if the group is, in addition, contracting. Comment: v3: final version for journal of Groups, Complexity, Cryptology. arXiv admin note: text overlap with arXiv:1703.07406

An Algorithm Using Modular Arithmetic for the Subset Sum Problem

1990 ◽  
Vol 21 (2) ◽  
pp. 1-10
Author(s):  
Toshiro Tachibana ◽  
Hideo Nakano ◽  
Yoshiro Nakanishi ◽  
Mitsuru Nakao
Keyword(s):  
Modular Arithmetic ◽  
Subset Sum Problem ◽  
Subset Sum

scholarly journals Trivial geometric heuristic for subset sum problem

2017 ◽  
Author(s):  
R U
Keyword(s):  
Greedy Algorithm ◽  
Dimensional Space ◽  
Approximate Solutions ◽  
Exact Algorithms ◽  
Approximation Schemes ◽  
Brute Force ◽  
Discrete Structure ◽  
Subset Sum Problem ◽  
Subset Sum ◽  
Hyper Plane

All exact algorithms for solving subset sum problem (SUBSET\_SUM) are exponential (brute force, branch and bound search, dynamic programming which is pseudo-polynomial). To find the approximate solutions both a classical greedy algorithm and its improved variety, and different approximation schemes are used.This paper is an attempt to build another greedy algorithm by transferring representation of analytic geometry to such an object of discrete structure as a set. Set of size $n$ is identified with $n$-dimensional space with Euclidean metric, the subset-sum is identified with (hyper)plane.

Sign in / Sign up

Export Citation Format

Share Document