scientific article; zbMATH DE number 7525510
From MaRDI portal
Publication:5075820
DOI10.4230/LIPIcs.ESA.2019.73MaRDI QIDQ5075820
Jesper Nederlof, Jakub Pawlewicz, Marcin Mucha, Karol Węgrzycki
Publication date: 11 May 2022
Full work available at URL: https://arxiv.org/abs/1905.02424
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (5)
Approximation schemes for subset-sums ratio problems ⋮ Approximating subset sum ratio via subset sum computations ⋮ A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics ⋮ Faster algorithms for \(k\)-\textsc{Subset Sum} and variations ⋮ Faster algorithms for \(k\)-subset sum and variations
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the equal-subset-sum problem
- Improved low-density subset sum algorithms
- On the complexity of the parity argument and other inefficient proofs of existence
- Reductions in \textbf{PPP}
- Number balancing is as hard as Minkowski's theorem and shortest vector
- Open problems around exact algorithms
- Efficient cryptographic schemes provably as secure as subset sum
- Saving space by algebraization
- Reducing a Target Interval to a Few Exact Queries
- Improved Generic Algorithms for Hard Knapsacks
- On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications
- A Remark on Stirling's Formula
- A polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem
- New Generic Algorithms for Hard Knapsacks
- Solving low-density subset sum problems
- Integer Sets with Distinct Subset-Sums
- A sum packing problem of Erdös and the Conway-Guy sequence
- A Survey of Problems in Combinatorial Number Theory
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
- Computing Partitions with Applications to the Knapsack Problem
- A Faster Pseudopolynomial Time Algorithm for Subset Sum
- A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum
- Dense Subset Sum may be the hardest
- Faster Pseudopolynomial Time Algorithms for Subset Sum
- Faster space-efficient algorithms for subset sum and k-sum
- SETH-Based Lower Bounds for Subset Sum and Bicriteria Path
- Parameterized and Exact Computation
- Space–Time Tradeoffs for Subset Sum: An Improved Worst Case Algorithm
- Hiding information and signatures in trapdoor knapsacks
- Fundamentals of Computation Theory
This page was built for publication:
