Codex @codex  0

 Incoming links: Many-one complete set

Past exam of the mathematics course of the University of Cambridge / 2023 / ii / Paper 1 / 12I / ii / Solution Created 2026-09-24 Updated 2026-09-25

A

is

C

-complete under many-one reductions when

A \in C and (\forall B \in C) B \leq_{m} A .

The first condition is membership in the class; the second is

C

-hardness. This is a many-one complete set.

 Read the full article