1![An FPTAS for the Subset Sum Problem Margarida Mamede, DI – FCT/UNL An FPTAS for the Subset Sum Problem Margarida Mamede, DI – FCT/UNL](https://www.pdfsearch.io/img/574c8c98ac8b6e2a2e94bcb72444f1af.jpg) | Add to Reading ListSource URL: orium.pw- Date: 2011-09-19 16:15:18
|
---|
2![The Subset Sum Problem Reducing Time Complexity of NP-Completeness with Quantum Search Abstract The Subset Sum Problem is a member of the NPcomplete class, so no known polynomial time algorithm exists for it. Although th The Subset Sum Problem Reducing Time Complexity of NP-Completeness with Quantum Search Abstract The Subset Sum Problem is a member of the NPcomplete class, so no known polynomial time algorithm exists for it. Although th](https://www.pdfsearch.io/img/a7b86d76359ddfa756a8a0709dceafba.jpg) | Add to Reading ListSource URL: ciim.usf.edu- Date: 1980-01-01 00:00:00
|
---|
3![Space-Efficient Randomized Algorithms for K-SUM Joshua R. Wang Stanford University, Stanford CA 94305, USA Space-Efficient Randomized Algorithms for K-SUM Joshua R. Wang Stanford University, Stanford CA 94305, USA](https://www.pdfsearch.io/img/3f37b1b4e46b36475cffd1351027854c.jpg) | Add to Reading ListSource URL: web.stanford.eduLanguage: English - Date: 2014-04-18 04:16:48
|
---|
4![Hans Kellerer, Ulrich Pferschy, David Pisinger Knapsack Problems Springer’s internal project number, if known Mathematics – Monograph (English) Hans Kellerer, Ulrich Pferschy, David Pisinger Knapsack Problems Springer’s internal project number, if known Mathematics – Monograph (English)](https://www.pdfsearch.io/img/2c30841d6cab746ae11ba82f7f581b5e.jpg) | Add to Reading ListSource URL: bioinfo.ict.ac.cnLanguage: English - Date: 2014-11-28 11:05:21
|
---|
5![Quantum algorithms for the subset-sum problem D. J. Bernstein University of Illinois at Chicago & Technische Universiteit Eindhoven Joint work with: Quantum algorithms for the subset-sum problem D. J. Bernstein University of Illinois at Chicago & Technische Universiteit Eindhoven Joint work with:](https://www.pdfsearch.io/img/02a9dbe79d322cf3da8c4c4d4eb73432.jpg) | Add to Reading ListSource URL: pqcrypto2013.xlim.frLanguage: English - Date: 2013-06-24 09:56:11
|
---|
6![SQUARES IN SUMSETS HOI H. NGUYEN AND VAN H. VU Abstract. A finite set A of integers is square-sum-free if there is no subset of A sums up to a square. In 1986, Erd˝ os posed the problem of determining the SQUARES IN SUMSETS HOI H. NGUYEN AND VAN H. VU Abstract. A finite set A of integers is square-sum-free if there is no subset of A sums up to a square. In 1986, Erd˝ os posed the problem of determining the](https://www.pdfsearch.io/img/de8f2949ed32cc1f8256e15e8028f3e7.jpg) | Add to Reading ListSource URL: people.math.osu.eduLanguage: English - Date: 2010-05-24 09:06:03
|
---|
7![Erratum to “Approximability of the Subset Sum Reconfiguration Problem⋆ ” Takehiro Ito1 and Erik D. Demaine2 1 2 Erratum to “Approximability of the Subset Sum Reconfiguration Problem⋆ ” Takehiro Ito1 and Erik D. Demaine2 1 2](https://www.pdfsearch.io/img/4e4ee21c0b8c18d15cc575697e00cb1a.jpg) | Add to Reading ListSource URL: www.ecei.tohoku.ac.jpLanguage: English - Date: 2013-07-03 21:00:59
|
---|
8![The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem ? (Extended Abstract) Vadim Lyubashevsky University of California at San Diego, La Jolla CA 92093, USA The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem ? (Extended Abstract) Vadim Lyubashevsky University of California at San Diego, La Jolla CA 92093, USA](https://www.pdfsearch.io/img/f638892af9e4627402ac2909f5de831f.jpg) | Add to Reading ListSource URL: www.di.ens.frLanguage: English - Date: 2010-09-13 15:36:39
|
---|
9![Sage Reference Manual: Numerical Optimization Release 6.7 The Sage Development Team Sage Reference Manual: Numerical Optimization Release 6.7 The Sage Development Team](https://www.pdfsearch.io/img/cc38d452f7ca19f6caf7281a9549b682.jpg) | Add to Reading ListSource URL: doc.sagemath.orgLanguage: English - Date: 2015-06-24 05:21:38
|
---|
10![UC Berkeley—CS 170: Efficient Algorithms and Intractable Problems Lecturer: David Wagner Handout 23 May 1, 2003 UC Berkeley—CS 170: Efficient Algorithms and Intractable Problems Lecturer: David Wagner Handout 23 May 1, 2003](https://www.pdfsearch.io/img/3b14638c5b20c21709e3ea1b0b580e90.jpg) | Add to Reading ListSource URL: www.cs.berkeley.eduLanguage: English - Date: 2015-01-21 19:48:42
|
---|