Live briefing
Everything about Combinatorial explosion
Rapid growth of the complexity of a problem due to its combinatorial properties
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. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Combinatorial explosionA 5-minute orientation
- Skim a recent paper: Quantum Annealing Boosts Prediction of Multimolecular Adsorption on Solid Surfaces Avoiding Combinatorial ExplosionInfluential work since 2022
- Pick up a classic book: Organic synthesis and molecular engineeringThe most-reprinted book on the subject
- Read the landmark paper: Combinatorial rule explosion eliminated by a fuzzy rule configurationCited 200 times
- Go sideways: Brute-force searchA closely related topic
- Go sideways: Solving chessA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Combinatorial rule explosion eliminated by a fuzzy rule configuration
Bypassing the Combinatorial Explosion: Using Similarity to Generate and Prioritize T-Wise Test Configurations for Software Product Lines
Steam explosion and its combinatorial pretreatment refining technology of plant biomass to bio‐based products
Production of oligosaccharides and biofuels from Miscanthus using combinatorial steam explosion and ionic liquid pretreatment
Combinatorial explosion in model gene networks
Combinatorial Explosion in Homogeneous Catalysis: Screening 60,000 Cross‐Coupling Reactions
Comments on "Combinatorial rule explosion eliminated by a fuzzy rule configuration" [with reply]
Sidestepping the Combinatorial Explosion: An Explanation of n -gram Frequency Effects Based on Naive Discriminative Learning
🆕 Influential since 2022
Quantum Annealing Boosts Prediction of Multimolecular Adsorption on Solid Surfaces Avoiding Combinatorial Explosion
Exploring the combinatorial explosion of amine–acid reaction space via graph editing
A Quantum Compass for Materials Discovery: Navigating the Combinatorial Explosion
Cutting-edge Algorithms to Overcome Combinatorial Explosion
Addressing the Combinatorial Explosion of Code-Based Visual Artifacts
📚 Books worth reading
Organic synthesis and molecular engineeringMogens Brøndsted Nielsen · 2013
Darwin's DoubtStephen C. Meyer · 2013
Handling combinatorial explosion in software testingMats Grindal · 2007
High-Performance ComputingJesus Labarta · 2008
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Brute-force search In computer science, brute-force search or exhaustive search, also known as generate and test, is a very general problem-solving technique and algorithmic…
- Solving chess Solving chess consists of finding an optimal strategy for the game of chess; that is, one by which one of the players (White or Black) can always force…
- Backtracking Backtracking is a class of algorithms for finding solutions to some computational problems, notably constraint satisfaction or enumeration problems, that…
- PSPACE-complete In computational complexity theory, a decision problem is PSPACE-complete if it can be solved using an amount of memory that is polynomial in the input…
- Sudoku solving algorithms A standard sudoku contains 81 cells, in a 9×9 grid, and has 9 boxes, each box being the intersection of the first, middle, or last 3 rows, and the first…
- Sudoku Sudoku (/suːˈdoʊkuː, -ˈdɒk-, sə-/; Japanese: 数独, romanized: sūdoku, lit. 'digit-single'; originally called Number Place) is a logic-based, combinatorial…
- Endgame tablebase In chess, an endgame tablebase, or simply tablebase, is a computerised database containing precalculated evaluations of endgame positions. Tablebases are…
- Combinatorial game theory Combinatorial game theory is a branch of mathematics and theoretical computer science that typically studies sequential games with perfect information…