233theorem sat_computation_time (n : ℕ) (hn : 0 < n) : 234 ∃ (c : ℝ), c > 0 ∧ 235 (sat_eval_time n n : ℝ) ≤ c * n^(1/3 : ℝ) * Real.log n 236-/ 237 238/-- **Recognition time** for SAT output (documentation / TODO): Ω(n) due to balanced-parity encoding. 239 240Intended claim: By balanced-parity hiding, reading fewer than n bits is insufficient to determine 241the SAT result. Any decoder reading a proper subset of the input bits will fail on at least 242one pair of tapes that match on the observed bits but differ in the total parity (and thus 243the result). -/ 244/-!
depends on (21)
Lean names referenced from this declaration's body.