Library / Computational Thinking DPF
Jump to passage
In this reading

Link to current text

Published source confirmed at last check

Source changed 2026-10-03 08:25:59 UTC · snapshot created 2026-10-03 08:26:43 UTC · last check 2026-10-03 09:35:10 UTC

CMP.5:12 - Relations

  • MATH.20: supplies the bound and inequality reasoning; MMP.10 supplies the feasible problem in a modeled receiving use.
  • CMP.1: transfers answers through effective problem reductions. The present relaxation can instead preserve a one-sided bound and require separate candidate recovery.
  • CMP.4: uses relaxed bounds to exclude or prioritize search branches and to describe remaining improvement.
  • C.29 and C.29.2: preserve the relation between the original subject question and the computational result being returned.
  • C.11.DUA and the general characterization, Pareto and improvement methods: guide comparison of solver effort, candidate quality and further work.