Decomposition
7 frameworks — Break complex problems into smaller, manageable parts with tree, graph, and recursive approaches.
Overview
Decomposition methods break complex problems into smaller, manageable parts using tree, graph, and recursive approaches. Instead of asking AI to solve everything at once, these techniques structure the problem space into interconnected sub-problems.
Use decomposition when facing problems too complex for a single prompt — multi-part analyses, planning tasks, or problems with interconnected dependencies. These techniques are especially valuable for programming, mathematical proofs, and strategic planning.
Decomposition 7
Least-to-Most
2022Break complex problems into progressively harder sub-problems.
Still active techniqueDECOMP
2022Decompose questions and delegate to specialized sub-question handlers.
Still active techniquePlan-and-Solve
2023Generate a plan before executing each step sequentially.
Still active techniqueTree of Thought
2023Explore multiple reasoning branches and evaluate alternative paths.
Still active techniqueGraph of Thought
2023Model reasoning as a graph with merging and refining operations.
Still active techniqueRecursion of Thought
2023Recursively decompose and solve nested sub-problems.
Still active techniqueProgram of Thought
2022Generate executable code as intermediate reasoning steps.
Still active techniqueSkeleton-of-Thought
2023Generate an outline first, then expand each point in parallel for faster structured responses.
Still active techniqueBranch-Solve-Merge
2023Decompose complex tasks into parallel branches, solve each independently, then merge results.
Still active techniqueSuccessive Prompting
2022Decompose complex questions into sequential sub-questions, answering each before proceeding.
Still active techniqueChain of Table
2024Reason over tabular data through step-by-step table operations for verifiable data analysis.
Still active techniqueTechnique Comparison
Side-by-side comparison of all 8 frameworks in this category.
| Technique | Year | Best For | Key Strength | Complexity |
|---|---|---|---|---|
| Least-to-Most | 2022 | Progressive problems | Incremental difficulty | Medium |
| DECOMP | 2022 | Multi-part questions | Sub-question delegation | Medium |
| Plan-and-Solve | 2023 | Sequential tasks | Plan-first approach | Medium |
| Tree of Thought | 2023 | Exploration tasks | Branch evaluation | High |
| Graph of Thought | 2023 | Complex dependencies | Merge operations | High |
| Recursion of Thought | 2023 | Nested problems | Recursive solving | High |
| Program of Thought | 2022 | Math & logic | Executable code | High |
| Skeleton-of-Thought | 2023 | Latency reduction | Parallel expansion | Medium |
Related Categories
Explore other framework categories that complement Decomposition.
Try Least-to-Most Prompting
Least-to-Most is the most accessible decomposition technique — break any complex problem into a series of progressively harder sub-problems, solving each one before tackling the next.