Combinatorial explosion
Rapid growth of the complexity of a problem due to how the combinatorics of the problem is affected by the input, constraints, and bounds of the problem
In mathematics, a combinatorial explosion is the rapid growth of the complexity of a problem due to the way its combinatorics depends on input, constraints and bounds. Combinatorial explosion is sometimes used to justify the intractability of certain problems.
Nº Q2668364 ★★
Uncommon · Knowledge
Combinatorial explosion
Rapid growth of the complexity of a problem due to how the combinatorics of the problem is affected by the input, constraints, and bounds of the problem
In mathematics, a combinatorial explosion is the rapid growth of the complexity of a problem due to the way its combinatorics depends on input, constraints and bounds. Combinatorial explosion is sometimes used to justify the intractability of certain problems.
From Wikipedia
In mathematics, a combinatorial explosion is the rapid growth of the complexity of a problem due to the way its combinatorics depends on input, constraints and bounds. Combinatorial explosion is sometimes used to justify the intractability of certain problems. Examples of such problems include certain mathematical functions, the analysis of some puzzles and games, and some pathological examples which can be modelled as the Ackermann function.
Text: Wikipédia, CC BY-SA 4.0. · Image: Ldecola (CC0) ·
Related cards
-
Knapsack problem
Problem in combinatorial optimization
Nº Q864457 ★★★
Not listed
-
Combinatorial optimization
Subset of mathematical optimization
Nº Q1333872 ★
Not listed
-
Combinational logic
Type of digital logic which is implemented by boolean circuits
Nº Q76505 ★★
Not listed
-
repeated combination
Nº Q2985052 ★
Not listed
-
C
Combinatorial chemistry
Chemical methods designed to rapidly synthesize large numbers of chemical compounds
Nº Q899212 ★
Not listed
-
M
Minimum-cost flow problem
Mathematical optimization problem
Nº Q2897180 ★
Not listed