Proof of `FF(1,m)||ΣZj is strongly NP-hard under the standard reading` (1st statement)
What this proof establishes
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
Description
Hitting Set (lax-496464), the numbers of its binary word, and the emitter, composed as Turing machines; the numbers of the emitted word are at most .