When the weights and biases of a neural network range over a fixed finite alphabet, training the network to fit a data set exactly becomes a finite combinatorial problem, and parameterized complexity asks which structural quantities of an instance make this problem tractable. Ganian, Sommer, and Sorge (ICLR 2026) showed that training quantized networks is fixed-parameter tractable when parameterized jointly by the input dimension $α$, the output dimension $ω$, and the treewidth of the architecture, and they asked whether $α+ω$ alone suffices. We show that it does not: training binary quantized networks is W[1]-hard parameterized by $α+ω$, so it admits no algorithm with running time $f(α+ω)\cdot|I|^{O(1)}$ for any computable $f$ unless FPT = W[1]. Hardness holds already for exact fitting of $k+1$ examples whose inputs equal their targets and form a coordinatewise prefix chain, and also when all biases are fixed to zero. The proof rests on a one-flip routing equivalence. On such data, nonnegative binary weights force every neuron to switch on at most once, and a network fits the data exactly if and only if the architecture contains vertex-disjoint paths that link each changing input to the corresponding output. Every neuron therefore has one of only $k+1$ activation profiles, yet deciding whether these profiles can be realized simultaneously is as hard as disjoint-path routing. Small input and output dimensions thus limit what each neuron can do locally, but not how the architecture forces neurons to share resources globally.
The PPSZ algorithm of Paturi, Pudlák, Saks, and Zane solves 3-SAT by processing the variables in a uniformly random order, setting a variable whenever a bounded number of clauses implies its value, and guessing it otherwise. Its running time is determined by how many variables are forced in this process, and the exact exponent is a central question in the study of exponential-time satisfiability algorithms. Scheder showed that the classical analysis of PPSZ is not tight for 3-SAT. We ask how much further a sharper analysis of the unmodified algorithm can go. Our analysis uses auxiliary distributions on variable orderings that correlate the positions of variables sharing critical clauses. Such correlations make forcing more likely for some variables, can make it less likely for others, and incur an entropy cost. We choose the correlated pairs at random on short components, so that every pair is selected with the same probability, and we express the forcing loss as a sum of weights attached to these pairs in advance. Gains and losses then scale by the same factor and can be compared directly. Combining the resulting estimate with the complementary estimate of Scheder through an explicit linear-programming certificate gives a uniform improvement for every uniquely satisfiable formula. We prove that the original PPSZ algorithm, with a sufficiently large but fixed implication strength, solves Unique-3-SAT in randomized time $O^*(1.306969598^n)$. Through the lifting framework of Scheder and Steinberger, it solves general 3-SAT in randomized time $O^*(1.307031578^n)$. Both bounds improve the guarantees obtained from the analysis of Scheder for the same algorithm. These improvements follow entirely from the analysis, while PPSZ continues to use a uniformly random variable order and unbiased guesses. It shows that the known guarantees for PPSZ can be strengthened by analysis alone.