Efficient reductions and algorithms for subset product

DOI10.1007/978-3-031-25211-2_1OpenAlexW4318023082MaRDI QIDQ6132518

Mahesh Sreekumar Rajasree, Pranjal Dutta

Publication date: 17 August 2023

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-25211-2_1

zbMATH Keywords

FFTpower serieslogspacesimultaneoussubset productpseudo-prime-factor

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

• Unnamed Item
• Unnamed Item
• A generic approach to proving NP-hardness of partition type problems
• Solving efficiently the 0-1 multi-objective knapsack problem
• Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
• Approximating the product knapsack problem
• Chosen-Ciphertext Security from Subset Sum
• Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
• VSH, an Efficient and Provable Collision-Resistant Hash Function
• A Rigorous Time Bound for Factoring Integers
• A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum
• Quantum Algorithms for the Subset-Sum Problem
• On the interval containing at least one prime number
• Subset Sum Quantumly in 1.17 n .
• Algebraic algorithms for variants of subset sum