[R] Johannes Hengelbrock <j.hengelbrock at uke.de>

[RICHARD M. HEIBERGER]

fortune candidate

Your example requires all choices of 1541 out of 3000, which I would expect to take somewhere near age-of-the-universe seconds to compute.   The code uses a clever nested compuation due to Gail et al which will cut that time down to infinity/10.

Sent from my iPhone

> On Jun 4, 2016, at 07:28, Therneau, Terry M., Ph.D. <therneau at mayo.edu> wrote:
> 
> Your example requires all choices of 1541 out of 3000, which I would expect to take somewhere near age-of-the-universe seconds to compute.   The code uses a clever nested compuation due to Gail et al which will cut that time down to infinity/10.