Proof of `An exponential time lower bound for WL Distinguishing`
groundedproofs/Lax119563Proofs/Hardness/ExpLower.lean · lax-119563
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
Let be decided by within steps, and put . For , , and the least number with , a machine computes in time (), and the pipeline turns it in time into an instance of length (), which -WL distinguishes iff . With , a decider for WL Distinguishing within steps runs within steps on these instances; together with the polynomial reduction this decides in time , a contradiction.