论文信息 - A dual version of Reimer's inequality and a proof of Rudich's conjecture

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

We prove 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 in cryptographic complexity. One consequence of Rudich's Conjecture is that there is an oracle relative to which one-way functions exist but one-way 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/spl cap/coNP/spl sube/i.o.AvgP relative to a random oracle.

Michael E. Saks | Jeff Kahn | Clifford D. Smyth | J. Kahn | M. Saks

[1] H. Kesten,et al. Inequalities with applications to percolation and reliability , 1985 .

[2] Gábor Tardos,et al. Query complexity, or why is it difficult to separateNPA∩coNPA fromPA by random oraclesA? , 1989, Comb..

[3] V. D. Berg,et al. On a Combinatorial Conjecture Concerning Disjoint Occurrences of Events , 1987 .

[4] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[5] Peter C. Fishburn,et al. On the FKB conjecture for disjoint intersections , 1991, Discret. Math..

[6] C. Fortuin,et al. Correlation inequalities on some partially ordered sets , 1971 .

[7] Dana Randall,et al. The van den Berg-Kesten-Reimer Inequality: A Review , 1999 .

[8] David Reimer,et al. Proof of the Van den Berg–Kesten Conjecture , 2000, Combinatorics, Probability and Computing.

[9] Yuji Maruyama,et al. Preface , 1997, Brain Research Bulletin.

[10] M. Talagrand. Some Remarks on the Berg-Kesten Inequality , 1994 .