Formula

Formula for Representing Problem Decomposition

In the context of least-to-most prompting, the decomposition of an initial problem, p0p_0, into a set of sub-problems, {p1,...,pn}\{p_1, ..., p_n\}, is represented by the formula {p1,...,pn}=G(p0)\{p_1, ..., p_n\} = G(p_0). The function GG in this equation symbolizes the decomposition method used to break down the original problem p0p_0 into its constituent parts.

Image 0

0

1

Updated 2026-05-02

Contributors are:

Who are from:

Tags

Ch.3 Prompting - Foundations of Large Language Models

Foundations of Large Language Models

Foundations of Large Language Models Course

Computing Sciences

Related