A dual version of Reimer's inequality and a proof of Rudich's Conjecture

We prole a dual version of the celebrated inequality of D. Reimer (a.k.a. the van den Berg-Kesten conjecture). We use the dual inequality to prove a combinatorial conjecture of S. Rudich motivated by questions ill cryptographic complexity: One consequence of Rudich's Conjecture is that there is art oracle relative to which one-way functions exist but one-sr ar permutations do not. The dual inequality has another combinatorial consequence which allows R. Impagliazzo and S. Rudich to prove that if P = NP then NP boolean AND coNP subset of or equal to i.o.AvgP relative to a random oracle.