GuiDub

Kagamin via Digitalmars-d digitalmars-d at puremagic.com
Tue Sep 29 01:44:18 PDT 2015


On Tuesday, 29 September 2015 at 08:04:57 UTC, ponce wrote:
> I think you said once that the dependency resolution is 
> NP-complete.

Exponential algorithmic complexity.


More information about the Digitalmars-d mailing list