Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

73

Voted

COMBINATORICS
1998

65views more COMBINATORICS 1998»

A Construction for Sets of Integers with Distinct Subset Sums

15 years 2 months ago

A Construction for Sets of Integers with Distinct Subset Sums

Download www.combinatorics.org

Tom Bohman

Real-time Traffic

COMBINATORICS 1998 |

claim paper

Related Content

» Interval Subset Sum and UniformPrice Auction Clearing

» Efficient Approximation Algorithms for the SubsetSums Equality Problem

» Lower bounds and heuristic algorithms for the k

» Two row mixedinteger cuts via lifting

» Sharp threshold and scaling window for the integer partitioning problem

» Integer linear programming as a tool for constructing trees from quartet data

» On Finding Small 2Generating Sets

» Parameterizing by the Number of Numbers

» Wooden Geometric Puzzles Design and Hardness Proofs

Post Info
More Details (n/a)

Added	21 Dec 2010
Updated	21 Dec 2010
Type	Journal
Year	1998
Where	COMBINATORICS
Authors	Tom Bohman

Comments (0)