Efficient reductions and algorithms for subset product
From MaRDI portal
Publication:6132518
DOI10.1007/978-3-031-25211-2_1OpenAlexW4318023082MaRDI QIDQ6132518FDOQ6132518
Authors: Pranjal Dutta, Mahesh Sreekumar Rajasree 
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
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving efficiently the 0-1 multi-objective knapsack problem
- A generic approach to proving NP-hardness of partition type problems
- VSH, an Efficient and Provable Collision-Resistant Hash Function
- On the interval containing at least one prime number
- A Rigorous Time Bound for Factoring Integers
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
- Algebraic algorithms for variants of subset sum
- Quantum algorithms for the subset-sum problem
- A near-linear pseudopolynomial time algorithm for subset sum
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
- Chosen-ciphertext security from subset sum
- Approximating the product knapsack problem
- Subset Sum Quantumly in 1.17 n .
Cited In (2)
This page was built for publication: Efficient reductions and algorithms for subset product
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132518)
