scientific article; zbMATH DE number 1058053

zbMATH Open0894.60007MaRDI QIDQ4353161FDOQ4353161

Authors: Vassilly. Voinov, Mikhail Nikulin 

Publication date: 30 August 1998

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 176777
• Solving dense subset-sum problems by using analytical number theory
• scientific article; zbMATH DE number 4149895
• On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem

zbMATH Keywords

compositionspartitionsgenerating functionknapsack problemcryptographyDiophantine equationdiscrete probability distributionsubset sum problem

Mathematics Subject Classification ID

Combinatorial probability (60C05) Diophantine approximation in probabilistic number theory (11K60)

Cited In (4)

• New analytical results in subset-sum problem
• Scheduling lower bounds via AND subset sum
• Stochastic analysis of greedy algorithms for the subset sum problem
• Multivariate discrete distributions induced by an urn scheme, linear Diophantine equations, unbiased estimating, testing and applications

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4353161)