Proof of `The inclusion chain of complexity classes` (5th statement)
What this proof establishes
no assumptions
Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.
In the paper
- page 4 of this submission's paper
Description
Extract the input from the existing pair encoding in linear time, then run the polynomial-time decider. The empty certificate suffices for every input.