Search results for "Subset-sum"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
74	Kequin Li	Probabilistic analysis of an approximation algorithm for maximum subset sum using recurrence relations.	ACM Southeast Regional Conference	1995	DBLP DOI BibTeX RDF	maximum subset sum, multiprogrammed parallel system, sequential selection, approximation algorithm, probabilistic analysis, knapsack, recurrence relations
67	Mihai Oltean, Oana Muntean	Solving the subset-sum problem with a light-based device.	Nat. Comput.	2009	DBLP DOI BibTeX RDF	Optical solutions, NP-complete, Unconventional computing, Subset sum
65	Ron Steinfeld, Josef Pieprzyk, Huaxiong Wang	Higher Order Universal One-Way Hash Functions from the Subset Sum Assumption.	Public Key Cryptography	2006	DBLP DOI BibTeX RDF
63	Miguel A. Gutiérrez-Naranjo, Mario J. Pérez-Jiménez, Francisco José Romero-Campero	A Linear Solution of Subset Sum Problem by Using Membrane Creation.	IWINAC (1)	2005	DBLP DOI BibTeX RDF	Cellular Complexity Classes, Subset Sum Problem, Membrane Computing, Natural Computing
55	Yuli Ye, Allan Borodin	Priority algorithms for the subset-sum problem.	J. Comb. Optim.	2008	DBLP DOI BibTeX RDF	Revocable acceptance, Approximation algorithm, Greedy, Subset-sum, Priority algorithm
50	Daxing Li, Shaohan Ma	Two Notes on Low-Density Subset Sum Algorithms.	ISAAC	1994	DBLP DOI BibTeX RDF
48	PeiZong Lee, Fang-Yu Huang, Chorng-Yuan Huang, Hwann-Tzong Chen	Efficient implementations of two variant subset sum problems: a case study of how to process appraisal books resulting from fire-destroyed money.	SAC	1996	DBLP DOI BibTeX RDF	first fit, object-oriented concept, spiral round robin, subset sum, bucket sort
48	Russell Impagliazzo, Moni Naor	Efficient Cryptographic Schemes Provably as Secure as Subset Sum	FOCS	1989	DBLP DOI BibTeX RDF	cryptographic schemes, universal one-way hash function, pseudorandom generator, NC, subset sum, intractability
47	Nick G. Duffield, Carsten Lund, Mikkel Thorup	Priority sampling for estimation of arbitrary subset sums.	J. ACM	2007	DBLP DOI BibTeX RDF	Subset sum estimation, reservoir sampling, sampling without replacement, weighted sampling
46	Anshul Kothari, Subhash Suri, Yunhong Zhou	Interval Subset Sum and Uniform-Price Auction Clearing.	COCOON	2005	DBLP DOI BibTeX RDF
44	Mario Szegedy	The DLT priority sampling is essentially optimal.	STOC	2006	DBLP DOI BibTeX RDF	integral formula, priority sampling, subset sum estimate, telescopic sums, network measurement, Internet traffic
42	Yuren Zhou, Zhi Guo, Jun He 0004	On the Running Time Analysis of the (1+1) Evolutionary Algorithm for the Subset Sum Problem.	LSMS (1)	2007	DBLP DOI BibTeX RDF
42	Matthijs J. Coster, Brian A. LaMacchia, Andrew M. Odlyzko, Claus-Peter Schnorr	An Improved Low-Denisty Subset Sum Algorithm.	EUROCRYPT	1991	DBLP DOI BibTeX RDF
42	J. C. Lagarias 0001, Andrew M. Odlyzko	Solving Low-Density Subset Sum Problems	J. ACM	1985	DBLP DOI BibTeX RDF
39	Zvi Galil, Oded Margalit	An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem.	ICALP	1991	DBLP DOI BibTeX RDF
38	Karl Bringmann	Approximating Subset Sum Ratio faster than Subset Sum.	SODA	2024	DBLP DOI BibTeX RDF
38	Karl Bringmann	Approximating Subset Sum Ratio faster than Subset Sum.	CoRR	2023	DBLP DOI BibTeX RDF
38	Giannis Alonistiotis, Antonis Antonopoulos, Nikolaos Melissinos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis	Approximating Subset Sum Ratio via Subset Sum Computations.	CoRR	2022	DBLP BibTeX RDF
38	Giannis Alonistiotis, Antonis Antonopoulos, Nikolaos Melissinos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis	Approximating Subset Sum Ratio via Subset Sum Computations.	IWOCA	2022	DBLP DOI BibTeX RDF
38	Mario Szegedy, Mikkel Thorup	On the Variance of Subset Sum Estimation.	ESA	2007	DBLP DOI BibTeX RDF
38	Abraham Flaxman, Bartosz Przydatek	Solving Medium-Density Subset Sum Problems in Expected Polynomial Time.	STACS	2005	DBLP DOI BibTeX RDF
36	Xin Chen 0037, Lan Liu 0001, Zheng Liu, Tao Jiang 0001	On the minimum common integer partition problem.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	approximation algorithm, combinatorial optimization, NP-hard, computational biology, Subset sum, integer partition
36	Phong Q. Nguyen, Jacques Stern	Adapting Density Attacks to Low-Weight Knapsacks.	ASIACRYPT	2005	DBLP DOI BibTeX RDF	Lattices, Knapsack, Public-Key Cryptanalysis, Subset Sum
36	Tanmoy Kanti Das, Subhamoy Maitra	Cryptanalysis of Optimal Differential Energy Watermarking (DEW) and a Modified Robust Scheme.	INDOCRYPT	2002	DBLP DOI BibTeX RDF	Cryptanalysis, Discrete Cosine Transform, Digital Watermarking, Subset Sum
34	Md. Raqibul Hasan, M. Sohel Rahman	Computing a Solution for the Subset Sum Problem with a Light Based Device.	OSC	2009	DBLP DOI BibTeX RDF
34	Daniel Díaz-Pernil, Miguel A. Gutiérrez-Naranjo, Mario J. Pérez-Jiménez, Agustin Riscos-Núñez	A Logarithmic Bound for Solving Subset Sum with P Systems.	Workshop on Membrane Computing	2007	DBLP DOI BibTeX RDF
34	Changlin Wan, Zhongzhi Shi	Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach.	FAW	2008	DBLP DOI BibTeX RDF
31	Tomohiro Shintani, Ryuichi Sakai	Cryptanalysis on 2 Dimensional Subset-sum Public Key Cryptosystem.	ICIS	2009	DBLP DOI BibTeX RDF	knapsack public key cryptosystem, cryptanalysis, lattice, shortest vector problem
31	Andrew Shallue	An Improved Multi-set Algorithm for the Dense Subset Sum Problem.	ANTS	2008	DBLP DOI BibTeX RDF
31	Tetsuya Izu, Jun Kogure, Takeshi Koshiba, Takeshi Shimoyama	Low-density attack revisited.	Des. Codes Cryptogr.	2007	DBLP DOI BibTeX RDF	AMS Classification 68P25, 11H31, 94B75, 68Q25
30	Daniel Shea	Solving the Subset Sum Problem with Heap-Ordered Subset Trees.	CoRR	2015	DBLP BibTeX RDF
29	Imad A. Ferzli, Farid N. Najm, Lars Kruse	Early power grid verification under circuit current uncertainties.	ISLPED	2007	DBLP DOI BibTeX RDF	subset-sum problem, hypercube, power grid, hyperplane, vertex
27	Jean Cardinal, John Iacono	Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets.	SOSA	2021	DBLP DOI BibTeX RDF
27	Jean Cardinal, John Iacono	Modular Subset Sum, Dynamic Strings, and Zero-Sum Sets.	CoRR	2020	DBLP BibTeX RDF
27	Nikhil Bansal 0001, Shashwat Garg, Jesper Nederlof, Nikhil Vyas 0001	Faster Space-Efficient Algorithms for Subset Sum, k-Sum, and Related Problems.	SIAM J. Comput.	2018	DBLP DOI BibTeX RDF
27	Nikhil Bansal 0001, Shashwat Garg, Jesper Nederlof, Nikhil Vyas 0001	Faster space-efficient algorithms for subset sum and k-sum.	STOC	2017	DBLP DOI BibTeX RDF
27	Nikhil Bansal 0001, Shashwat Garg, Jesper Nederlof, Nikhil Vyas 0001	Faster Space-Efficient Algorithms for Subset Sum, k-Sum and Related Problems.	CoRR	2016	DBLP BibTeX RDF
27	Daniel Díaz-Pernil, Miguel A. Gutiérrez-Naranjo, Mario J. Pérez-Jiménez, Agustin Riscos-Núñez	Solving Subset Sum in Linear Time by Using Tissue P Systems with Cell Division.	IWINAC (1)	2007	DBLP DOI BibTeX RDF
27	Yuli Ye, Allan Borodin	Priority Algorithms for the Subset-Sum Problem.	COCOON	2007	DBLP DOI BibTeX RDF
27	Vadim Lyubashevsky	The Parity Problem in the Presence of Noise, Decoding Random Linear Codes, and the Subset Sum Problem.	APPROX-RANDOM	2005	DBLP DOI BibTeX RDF
27	Joachim von zur Gathen, Igor E. Shparlinski	Predicting Subset Sum Pseudorandom Generators.	Selected Areas in Cryptography	2004	DBLP DOI BibTeX RDF
20	Michael Kharitonov	Cryptographic Lower Bounds for Learnability of Boolean Functions on the Uniform Distribution.	COLT	1992	DBLP DOI BibTeX RDF
19	Tatiana Belova, Nikolai Chukhin, Alexander S. Kulikov, Ivan Mihajlin	Improved Space Bounds for Subset Sum.	CoRR	2024	DBLP DOI BibTeX RDF
19	Lin Chen 0009, Jiayi Lian, Yuchen Mao, Guochuan Zhang	An Improved Pseudopolynomial Time Algorithm for Subset Sum.	CoRR	2024	DBLP DOI BibTeX RDF
19	Lin Chen 0009, Jiayi Lian, Yuchen Mao, Guochuan Zhang	Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results.	SODA	2024	DBLP DOI BibTeX RDF
19	Igor E. Shparlinski	Fixed points of the subset sum pseudorandom number generators.	Des. Codes Cryptogr.	2023	DBLP DOI BibTeX RDF
19	Chenyang Xu 0002, Guochuan Zhang	Learning-augmented algorithms for online subset sum.	J. Glob. Optim.	2023	DBLP DOI BibTeX RDF
19	Lin Chen 0009, Jiayi Lian, Yuchen Mao, Guochuan Zhang	Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results.	CoRR	2023	DBLP DOI BibTeX RDF
19	Xi Chen 0001, Yaonan Jin, Tim Randolph 0001, Rocco A. Servedio	Subset Sum in Time 2n/2/poly(n).	CoRR	2023	DBLP DOI BibTeX RDF
19	Jules Maire, Damien Vergnaud	Commitments with Efficient Zero-Knowledge Arguments from Subset Sum Problems.	IACR Cryptol. ePrint Arch.	2023	DBLP BibTeX RDF
19	Bogdan Aman	Solving subset sum by spiking neural P systems with astrocytes producing calcium.	Nat. Comput.	2023	DBLP DOI BibTeX RDF
19	Antonis Antonopoulos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis	Faster algorithms for k-subset sum and variations.	J. Comb. Optim.	2023	DBLP DOI BibTeX RDF
19	Arthur Carvalho Walraven da Cunha, Francesco D'Amore 0001, Frédéric Giroire, Hicham Lesfari, Emanuele Natale, Laurent Viennot	Revisiting the Random Subset Sum Problem.	ESA	2023	DBLP DOI BibTeX RDF
19	Charles Bouillaguet, Florette Martinez, Damien Vergnaud	Cryptanalysis of a Generalized Subset-Sum Pseudorandom Generator.	MFCS	2023	DBLP DOI BibTeX RDF
19	Andre Esser 0001, Floyd Zweydinger	New Time-Memory Trade-Offs for Subset Sum - Improving ISD in Theory and Practice.	EUROCRYPT (5)	2023	DBLP DOI BibTeX RDF
19	Jules Maire, Damien Vergnaud	Commitments with Efficient Zero-Knowledge Arguments from Subset Sum Problems.	ESORICS (1)	2023	DBLP DOI BibTeX RDF
19	Xi Chen 0001, Yaonan Jin, Tim Randolph 0001, Rocco A. Servedio	Subset Sum in Time 2n/2 / poly(n).	APPROX/RANDOM	2023	DBLP DOI BibTeX RDF
19	Yawen Zheng, Jing Yang, Tongtong Zhang, Tianyi Jiang	An Investigation into the Use of DNA Strand Displacement Reaction Networks for Subset Sum Problem Solutions.	BIC-TA (1)	2023	DBLP DOI BibTeX RDF
19	Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay	SETH-based Lower Bounds for Subset Sum and Bicriteria Path.	ACM Trans. Algorithms	2022	DBLP DOI BibTeX RDF
19	Khodakhast Bibak, Behrouz Zolfaghari	The Modular Subset-Sum Problem and the size of deletion correcting codes.	Des. Codes Cryptogr.	2022	DBLP DOI BibTeX RDF
19	Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay	Scheduling lower bounds via AND subset sum.	J. Comput. Syst. Sci.	2022	DBLP DOI BibTeX RDF
19	Frank Gurski, Dominique Komander, Carolin Rehs	Correction to: Solutions for subset sum problems with special digraph constraints.	Math. Methods Oper. Res.	2022	DBLP DOI BibTeX RDF
19	Qilin Zheng, Pingyu Zhu, Shichuan Xue, Yang Wang, Chao Wu, Xinyao Yu, Miaomiao Yu, Yingwen Liu, Mingtang Deng, Junjie Wu 0003, Ping Xu	Quantum algorithm and experimental demonstration for the subset sum problem.	Sci. China Inf. Sci.	2022	DBLP DOI BibTeX RDF
19	Luca Becchetti, Arthur Carvalho Walraven da Cunha, Andrea Clementi, Francesco D'Amore 0001, Hicham Lesfari, Emanuele Natale, Luca Trevisan	On the Multidimensional Random Subset Sum Problem.	CoRR	2022	DBLP DOI BibTeX RDF
19	Hamed Saleh, Saeed Seddighin	Dynamic Subset Sum with Truly Sublinear Processing Time.	CoRR	2022	DBLP DOI BibTeX RDF
19	Divesh Aggarwal, Rajendra Kumar 0002	Why we couldn't prove SETH hardness of the Closest Vector Problem for even norms, and of the Subset Sum Problem!	CoRR	2022	DBLP DOI BibTeX RDF
19	Bojun Lu, Duan Li 0002, Rujun Jiang	Tackling A Class of Hard Subset-Sum Problems: Integration of Lattice Attacks with Disaggregation Techniques.	CoRR	2022	DBLP BibTeX RDF
19	Xiaoyu Wu, Lin Chen	Improved Approximation Schemes for (Un-)Bounded Subset-Sum and Partition.	CoRR	2022	DBLP DOI BibTeX RDF
19	Andre Esser 0001, Floyd Zweydinger	New Time-Memory Trade-Offs for Subset Sum - Improving ISD in Theory and Practice.	IACR Cryptol. ePrint Arch.	2022	DBLP BibTeX RDF
19	Thibauld Feneuil, Jules Maire, Matthieu Rivain, Damien Vergnaud	Zero-Knowledge Protocols for the Subset Sum Problem from MPC-in-the-Head with Rejection.	IACR Cryptol. ePrint Arch.	2022	DBLP BibTeX RDF
19	Lijie Chen 0001, Ce Jin 0001, R. Ryan Williams, Hongxun Wu	Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions.	SODA	2022	DBLP DOI BibTeX RDF
19	David Biesner, Thore Gerlach, Christian Bauckhage, Bernd Kliem, Rafet Sifa	Solving Subset Sum Problems using Quantum Inspired Optimization Algorithms with Applications in Auditing and Financial Data Analysis.	ICMLA	2022	DBLP DOI BibTeX RDF
19	Pranjal Dutta, Mahesh Sreekumar Rajasree	Algebraic Algorithms for Variants of Subset Sum.	CALDAM	2022	DBLP DOI BibTeX RDF
19	Jonathan Allcock, Yassine Hamoudi, Antoine Joux, Felix Klingelhöfer, Miklos Santha	Classical and Quantum Algorithms for Variants of Subset-Sum via Dynamic Programming.	ESA	2022	DBLP DOI BibTeX RDF
19	Thibauld Feneuil, Jules Maire, Matthieu Rivain, Damien Vergnaud	Zero-Knowledge Protocols for the Subset Sum Problem from MPC-in-the-Head with Rejection.	ASIACRYPT (2)	2022	DBLP DOI BibTeX RDF
19	Marco Pavone 0002	On the subset sum problem for finite fields.	Finite Fields Their Appl.	2021	DBLP DOI BibTeX RDF
19	Astrid Pieterse, Gerhard J. Woeginger	The subset sum game revisited.	Theory Comput. Syst.	2021	DBLP DOI BibTeX RDF
19	Lijie Chen 0001, Ce Jin 0001, R. Ryan Williams, Hongxun Wu	Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions.	CoRR	2021	DBLP BibTeX RDF
19	Antonis Antonopoulos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis	Faster Algorithms for k-Subset Sum and Variations.	CoRR	2021	DBLP BibTeX RDF
19	Pranjal Dutta, Mahesh Sreekumar Rajasree	Efficient reductions and algorithms for variants of Subset Sum.	CoRR	2021	DBLP BibTeX RDF
19	Adam Polak 0001, Lars Rohwedder, Karol Wegrzycki	Knapsack and Subset Sum with Small Items.	CoRR	2021	DBLP BibTeX RDF
19	Jonathan Allcock, Yassine Hamoudi, Antoine Joux, Felix Klingelhöfer, Miklos Santha	Classical and quantum dynamic programming for Subset-Sum and variants.	CoRR	2021	DBLP BibTeX RDF
19	Majid Salimi, Hamid Mala	A Polynomial-Time Algorithm for Special Cases of the Unbounded Subset-Sum Problem.	CoRR	2021	DBLP BibTeX RDF
19	Michael Konopik, Till Korten, Heiner Linke, Eric Lutz	Solving the subset sum problem with a nonideal biological computer.	CoRR	2021	DBLP BibTeX RDF
19	Karl Bringmann, Vasileios Nakos	Top-k-Convolution and the Quest for Near-Linear Output-Sensitive Subset Sum.	CoRR	2021	DBLP BibTeX RDF
19	Mahdie Eghdami, Mahmoud Naghibzadeh	SSA: Subset sum approach to protein β-sheet structure prediction.	Comput. Biol. Chem.	2021	DBLP DOI BibTeX RDF
19	Jean-Sébastien Coron, Agnese Gini	Provably Solving the Hidden Subset Sum Problem via Statistical Learning.	IACR Cryptol. ePrint Arch.	2021	DBLP BibTeX RDF
19	Roman Kolpakov, Mikhail Posypkin	Optimality and Complexity Analysis of a Branch-and-Bound Method in Solving Some Instances of the Subset Sum Problem.	Open Comput. Sci.	2021	DBLP DOI BibTeX RDF
19	Karl Bringmann, Philip Wellnitz	On Near-Linear-Time Algorithms for Dense Subset Sum.	SODA	2021	DBLP DOI BibTeX RDF
19	Ce Jin 0001, Nikhil Vyas 0001, Ryan Williams 0001	Fast Low-Space Algorithms for Subset Sum.	SODA	2021	DBLP DOI BibTeX RDF
19	Karl Bringmann, Vasileios Nakos	A Fine-Grained Perspective on Approximating Subset Sum and Partition.	SODA	2021	DBLP DOI BibTeX RDF
19	Victor Parque	Tackling the Subset Sum Problem with Fixed Size using an Integer Representation Scheme.	CEC	2021	DBLP DOI BibTeX RDF
19	Krzysztof Potepa	Faster Deterministic Modular Subset Sum.	ESA	2021	DBLP DOI BibTeX RDF
19	Adam Polak 0001, Lars Rohwedder, Karol Wegrzycki	Knapsack and Subset Sum with Small Items.	ICALP	2021	DBLP DOI BibTeX RDF
19	Daan van den Berg, Pieter Adriaans	Subset Sum and the Distribution of Information.	IJCCI	2021	DBLP DOI BibTeX RDF
19	Antonis Antonopoulos, Aris Pagourtzis, Stavros Petsalakis, Manolis Vasilakis	Faster Algorithms for k-Subset Sum and Variations.	IJTCS-FAW	2021	DBLP DOI BibTeX RDF
19	Victor Parque	Generating combinations on the GPU and its application to the k-subset sum.	GECCO Companion	2021	DBLP DOI BibTeX RDF
19	Gwangbae Choi, Serge Vaudenay	Towards Witness Encryption Without Multilinear Maps - Extractable Witness Encryption for Multi-subset Sum Instances with No Small Solution to the Homogeneous Problem.	ICISC	2021	DBLP DOI BibTeX RDF
19	Kosei Nagao, Akihiro Fujiwara	An asynchronous P system with branch and bound for solving the subset sum problem.	CANDAR (Workshops)	2021	DBLP DOI BibTeX RDF
19	Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin 0001, Vasileios Nakos, Christos Tzamos, Hongxun Wu	Fast and Simple Modular Subset Sum.	SOSA	2021	DBLP DOI BibTeX RDF