fpf.tools
Library / Computational Thinking DPF
Jump to passage
In this reading
Source · lines 1035–1043

Link to current text

Published source confirmed at last check

Source changed 2026-10-02 23:06:08 UTC · snapshot created 2026-10-03 01:38:24 UTC · last check 2026-10-03 03:35:15 UTC

CMP.4:12 - Relations

  • C.29.2: states the wanted computational answer and its resource conditions.
  • CMP.2: supplies recursive decomposition; CMP.3 identifies repeated remaining subproblems and schedules their evaluation.
  • CMP.5 and MATH.20: construct useful relaxed bounds and justify the corresponding inequalities.
  • MMP.10: supplies the admissible problem when search serves a modeled subject question.
  • C.11.DUA: guides the value of further exploration, stronger bounds or additional checking.
  • C.40: supports the wider development of alternatives and problems, including situations in which the search space or objective itself is being changed.