Algebraic algorithms for variants of subset sum
From MaRDI portal
(Redirected from Publication:6102280)
Recommendations
- An exact algorithm for the subset sum problem
- On variations of the subset sum problem
- Faster algorithms for \(k\)-subset sum and variations
- Subquadratic algorithms for algebraic 3SUM
- Faster algorithms for \(k\)-\textsc{Subset Sum} and variations
- scientific article; zbMATH DE number 1381690
- scientific article; zbMATH DE number 4058861
- Subquadratic algorithms for algebraic generalizations of 3SUM
- On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem
Cites work
- A near-linear pseudopolynomial time algorithm for subset sum
- A remark on Artin's conjecture
- Artin's primitive root conjecture -- a survey
- Character sums and deterministic polynomial root finding in finite fields
- Chosen-ciphertext security from subset sum
- Faster Pseudopolynomial Time Algorithms for Subset Sum
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 1303174 (Why is no real title available?)
- Linear Time Algorithms for Knapsack Problems with Bounded Weights
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
- Matching is as easy as matrix inversion
- Modern computer algebra
- On a distribution property of the residual order of \(a\pmod p\). I
- On finding primitive roots in finite fields
- On the deterministic complexity of factoring polynomials over finite fields
- On the interval containing at least one prime number
- PRIMES is in P
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
- Quadratic Time-Space Lower Bounds for Computing Natural Functions with a Random Oracle
- Quantum algorithms for the subset-sum problem
- Randomness efficient identity testing of multivariate polynomials
- Saving space by algebraization
- SETH-based lower bounds for subset sum and bicriteria path
- Threshold circuits of small majority-depth
Cited in
(5)- scientific article; zbMATH DE number 3936499 (Why is no real title available?)
- AI*IA 2003: Advances in Artificial Intelligence
- Efficient reductions and algorithms for subset product
- Approximating subset sum ratio via partition computations
- Algorithmic aspects of alternating sum of volumes. I: Data structure and difference operation
This page was built for publication: Algebraic algorithms for variants of subset sum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6102280)
