Prediction from Partial Information and Hindsight, with Application to Circuit Lower Bounds

[1]  Emanuele Viola,et al.  Indistinguishability by Adaptive Procedures with Advice, and Lower Bounds on Hardness Amplification Proofs , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[2]  Navid Talebanfard,et al.  Prediction from Partial Information and Hindsight, an Alternative Proof , 2018, Electron. Colloquium Comput. Complex..

[3]  Irit Dinur,et al.  Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity , 2016, computational complexity.

[4]  Or Meir,et al.  An Efficient Randomized Protocol for every Karchmer-Wigderson Relation with Two Rounds , 2017, Electron. Colloquium Comput. Complex..

[5]  Or Meir.  An Efficient Randomized Protocol for every Karchmer-Wigderson Relation with Three Rounds Or Meir , 2017 .

[6]  Rocco A. Servedio,et al.  Poly-logarithmic Frege depth lower bounds via an expander switching lemma , 2016, STOC.

[7]  Rocco A. Servedio,et al.  Near-optimal small-depth lower bounds for small distance connectivity , 2015, STOC.

[8]  Emanuele Viola,et al.  On Randomness Extraction in AC0 , 2015, Electron. Colloquium Comput. Complex..

[9]  Ran Raz,et al.  Exponential Separation of Information and Communication , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[10]  Or Meir,et al.  Toward better formula lower bounds: an information complexity approach to the KRW composition conjecture , 2014, STOC.

[11]  Ran Raz,et al.  Interactive channel capacity , 2013, STOC '13.

[12]  Hossein Jowhari,et al.  Tight bounds for Lp samplers, finding duplicates in streams, and related problems , 2010, PODS.

[13]  Ran Raz,et al.  Super-logarithmic depth lower bounds via the direct sum in communication complexity , 1995, computational complexity.

[14]  Pavel Pudlák,et al.  Top-down lower bounds for depth-three circuits , 1995, computational complexity.

[15]  Ziv Bar-Yossef,et al.  An information statistics approach to data stream and communication complexity , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[16]  Pavel Pudlák,et al.  Satisfiability Coding Lemma , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[17]  Ravi B. Boppana,et al.  The Average Sensitivity of Bounded-Depth Circuits , 1997, Inf. Process. Lett..

[18]  Eyal Kushilevitz,et al.  Communication Complexity , 1997, Adv. Comput..

[19]  Noam Nisan,et al.  Randomness is Linear in Space , 1996, J. Comput. Syst. Sci..

[20]  Ran Raz,et al.  A parallel repetition theorem , 1995, STOC '95.

[21]  P. Beame.  A switching lemma primer , 1994 .

[22]  Alexander A. Razborov,et al.  On the Distributional Complexity of Disjointness , 1992, Theor. Comput. Sci..

[23]  A. Razborov.  On submodular complexity measures , 1992 .

[24]  Eyal Kushilevitz,et al.  Fractional covers and communication complexity , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[25]  Russell Impagliazzo,et al.  Communication complexity towards lower bounds on circuit depth , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[26]  Ran Raz,et al.  Super-logarithmic depth lower bounds via direct sum in communication complexity , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[27]  Noam Nisan,et al.  Rounds in communication complexity revisited , 1991, STOC '91.

[28]  M. Sipser,et al.  Monotone Separation of Logspace from NC. , 1991 .

[29]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[30]  Ran Raz,et al.  Monotone circuits for matching require linear depth , 1990, STOC '90.

[31]  Alexander A. Razborov,et al.  Applications of matrix methods to the theory of lower bounds in computational complexity , 1990, Comb..

[32]  Noam Nisan,et al.  Constant depth circuits, Fourier transform, and learnability , 1989, 30th Annual Symposium on Foundations of Computer Science.

[33]  Ran Raz,et al.  Probabilistic Communication Complexity of Boolean Relations (Extended Abstract) , 1989, IEEE Annual Symposium on Foundations of Computer Science.

[34]  Avi Wigderson,et al.  Monotone circuits for connectivity require super-logarithmic depth , 1990, STOC '88.

[35]  Johan Håstad,et al.  Almost optimal lower bounds for small depth circuits , 1986, STOC '86.

[36]  Lyle A. McGeoch.  A strong separation between k and k-1 round communication complexity for a constructive language , 1986 .

[37]  Zvi Galil,et al.  Lower bounds on communication complexity , 1984, STOC '84.

[38]  Mihalis Yannakakis,et al.  On Monotone Formulae with Restricted Depth (Preliminary Version) , 1984, Symposium on the Theory of Computing.

[39]  Miklós Ajtai,et al.  ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..

[40]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[41]  V. M. Khrapchenko.  Method of determining lower bounds for the complexity of P-schemes , 1971 .