Random Parameter Noise Does Not Make Exact ReLU Verification Easy

We study exact verification of ReLU networks in an adversarial smoothed model. Every network weight and bias is independently perturbed by Gaussian noise, clipped to [-2,2], and rounded to the exact dyadic grid determined by the input bit complexity. We show that, under the standard assumption NPnotsubseteqBPP, there is no sound and complete verifier whose expected running time is polynomial in network size, bit complexity, and inverse noise level for every base instance. The conclusion already holds at the fixed noise level σ_star=2-11 for one-hidden-layer networks over a unit box, with hidden fan-in at most three and base coefficients in [-1,1]. The proof combines an exact gap embedding with a quantitative robustness argument. For every E3SAT formula Phi with m clauses, a four-ReLU-per-clause construction satisfies maxx∈[0,1]n g_Phi(x)=(m-operatornameunsat(Phi))/3, and coordinatewise threshold rounding never decreases the objective. A weighted parameter-sensitivity inequality and Gaussian concentration then show that a verification gap linear in m survives the aggregate perturbation of all coefficients with probability at least 1-e-m/8. The proof includes clipping, exact dyadic rounding, output-layer perturbations, polynomial-bit sampling of the rounded Gaussian law, and the conversion from expected smoothed running time to a BPP algorithm. Computational checks test the exact identity and illustrate the different scaling of extensive and constant gaps; they are diagnostics rather than evidence for the complexity theorem. The result concerns worst-case base networks in the stated absolute-noise model, but it shows that parameter nondegeneracy alone does not yield a universal smoothed-polynomial guarantee for exact verification.