On Tuesday, 8 December 2015 at 16:25:50 UTC, tn wrote:
... and that m is more than polynomially larger than s. ...
Should of course be "larger than n".
- What complexity have a log(sum) shap... Andrei Alexandrescu via Digitalmars-d
- Re: What complexity have a log(... tn via Digitalmars-d
- Re: What complexity have a ... tn via Digitalmars-d
- Re: What complexity have a log(... Timon Gehr via Digitalmars-d
- Re: What complexity have a ... Andrei Alexandrescu via Digitalmars-d
- Re: What complexity hav... cym13 via Digitalmars-d
- Re: What complexity... cym13 via Digitalmars-d
- Re: What complexity... Timon Gehr via Digitalmars-d
- Re: What compl... Charles via Digitalmars-d
- Re: What c... Timon Gehr via Digitalmars-d
- Re: What complexity... Charles via Digitalmars-d
