combinatorial

The thing is: poetry had not even properly begun to explore the combinatorial space of forms.

So if you mix them all in combinatorial order they can form all known numbers in that base.

There is no free lunch in that you'd still need to compute the 'difference', which is a combinatorial search.

Pretty thorough for a section of backtrack, within a section on generating all possibilities, within a full chapter on combinatorial searching.

The reason this book is different from any other is because the proofs are all combinatorial, like counting beaded necklaces or otherwise.

There is a combinatorial explosion of the state space as a program's dependencies increase.

When solving a combinatorial (optimization) problem, using a suitable modelling language is always nice.

This works, but splits our values into two worlds, causing a combinatorial explosion of decisions to be made (should condition be a thunk?

Both use essentially the same style of modeling digital hardware (which is really neither of those): encapsulated modules with ports, clocked processes, and combinatorial logic.

I would make a stronger statement: numerical algorithms (computational continuous mathematics) are seriously neglected in favor of combinatorial algorithms (computational discrete mathematics).

Take any undergrad algorithms class: 99% of it is combinatorial.

When we look closely at things, we always find combinatorial structures of discrete entities (smooth matter -> atoms -> protons -> quarks).

"Chilling" in combinatorial game theory means, in effect, making players pay a penalty for each move they make.

In combinatorial games, that's because the "value" of a position changes less wildly with each move in a cooled/chilled game.

My understanding is that Berlekamp's book is all about applying combinatorial game theory to go, and the "chilling" in question has very little to do with the "temperature-decrease" schedule in simulated annealing.