Sciweavers

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

10

RSA
1998

favoriteEmaildiscussreport

28views more RSA 1998»

Exponentially small bounds on the expected optimum of the partition and subset sum problems

13 years 4 months ago

Exponentially small bounds on the expected optimum of the partition and subset sum problems

Download www.ics.uci.edu

George S. Lueker

Real-time Traffic

RSA 1998 |

claim paper

Related Content

» Constructive Proofs of Concentration Bounds

» Tight informationtheoretic lower bounds for welfare maximization in combinatorial auctions

» Connection Preemption in MultiClass Networks

» New Approaches for Virtual Private Network Design

» Linear Systems over Composite Moduli

» Dynamic and Nonuniform Pricing Strategies for Revenue Maximization

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	1998
Where	RSA
Authors	George S. Lueker

Comments (0)