It's also worth looking at all-pairs testing. The insight is that you can cover all pairs of a set of combinations in only O(N^2) tests rather than O(N^D) irres

It's also worth looking at all-pairs testing. The insight is that you can cover all pairs of a set of combinations in only O(N^2) tests rather than O(N^D) irrespective of the number of dimensions. The number of tests ends up being the product of the size of the two largest dimensions. So in your example you can cover all combinations of each pair: * (lib A, lib B) * (lib A, language runtime) * (lib A, browser) * (lib B, language runtime) * (lib A, browser) * (language runtime, browser) in 50*30 = 1500 tests (or a little more to make the analysis tractable)