scientific article; zbMATH DE number 1315279
From MaRDI portal
Publication:4256495
zbMath0987.90061MaRDI QIDQ4256495
Publication date: 13 July 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Number-theoretic algorithms; complexity (11Y16)
Related Items (6)
Subset-sum problems with different summands: Computation ⋮ When subset-sums do not cover all the residues modulo \(p\). ⋮ An Improved Multi-set Algorithm for the Dense Subset Sum Problem ⋮ On subset sums of \(r\)-sets ⋮ Faster Pseudopolynomial Time Algorithms for Subset Sum ⋮ Constructing Carmichael numbers through improved subset-product algorithms
This page was built for publication:
