There is a combinatorial explosion of name-card exchanges and introductions.

Pathological examples of combinatorial explosion include functions such as the Ackermann function.

One can get a decent brute force chess computer player because the combinatorial explosion is slow compared to go.

The problem is what computer scientists call combinatorial explosion, and it happens even in a game like tick-tack-toe.

However, if this is not the case we may find a combinatorial explosion of word strings.

They reduce the average branching factor and hence the potential combinatorial explosion of paths through the graph.

We shall now look at ways of reducing the potential combinatorial explosion of breadth-first search.

This effect is also known as the combinatorial explosion.

This produces a considerable combinatorial explosion, making processing beyond the first level somewhat impractical.

It is designed to prevent combinatorial explosion in fuzzy logic rules.