The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound

2020 ◽  
pp. 445-460 ◽  
Author(s):  
Alexander Helm ◽  
Alexander May
Keyword(s):  
Subset Sum

On generic complexity of the subset sum problem in monoids and groups of integer matrix of order two

2020 ◽  
Vol 25 (4) ◽  
pp. 10-15
Author(s):  
Alexander Nikolaevich Rybalov
Keyword(s):  
Linear Group ◽  
Modular Group ◽  
Special Linear Group ◽  
Second Order ◽  
Integer Matrix ◽  
Subset Sum ◽  
Algorithmic Problems ◽  
Almost All ◽  
Subset Sum Problems ◽  
Generic Complexity

Generic-case approach to algorithmic problems was suggested by A. Miasnikov, I. Kapovich, P. Schupp and V. Shpilrain in 2003. This approach studies behavior of an algo-rithm on typical (almost all) inputs and ignores the rest of inputs. In this paper, we prove that the subset sum problems for the monoid of integer positive unimodular matrices of the second order, the special linear group of the second order, and the modular group are generically solvable in polynomial time.

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

Parallel approximation schemes for Subset Sum and Knapsack problems

1987 ◽  
Vol 24 (4) ◽  
pp. 417-432 ◽  
Author(s):  
Joseph G. Peters ◽  
Larry Rudolph
Keyword(s):  
Knapsack Problems ◽  
Approximation Schemes ◽  
Subset Sum ◽  
Parallel Approximation

scholarly journals Statistical mechanics of an NP-complete problem: subset sum

2001 ◽  
Vol 34 (44) ◽  
pp. 9555-9567 ◽  
Author(s):  
Tomohiro Sasamoto ◽  
Taro Toyoizumi ◽  
Hidetoshi Nishimori
Keyword(s):  
Statistical Mechanics ◽  
Complete Problem ◽  
Subset Sum ◽  
Np Complete
Sign in / Sign up

Export Citation Format

Share Document