One-way multiparty communication lower bound for pointer jumping with applications
暂无分享,去创建一个
[1] Amit Chakrabarti,et al. Lower Bounds for Multi-Player Pointer Jumping , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).
[2] Russell Impagliazzo,et al. Improved depth lower bounds for small distance connectivity , 1998, computational complexity.
[3] Avi Wigderson,et al. A direct sum theorem for corruption and the multiparty NOF communication complexity of set disjointness , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).
[4] Troy Lee,et al. Disjointness is Hard in the Multiparty Number-on-the-Forehead Model , 2007, 2008 23rd Annual IEEE Conference on Computational Complexity.
[5] Paul Beame,et al. MULTIPARTY COMMUNICATION COMPLEXITY AND THRESHOLD CIRCUIT SIZE OF AC0∗ , 2010 .
[6] Alexander A. Sherstov. SeparatingAC0 from Depth-2 Majority Circuits , 2009, SIAM J. Comput..
[7] André Gronemeier. NOF-Multiparty Information Complexity Bounds for Pointer Jumping , 2006, MFCS.
[8] Alexander A. Razborov,et al. n^Omega(log n) Lower Bounds on the Size of Depth-3 Threshold Circuits with AND Gates at the Bottom , 1993, Information Processing Letters.
[9] Emanuele Viola,et al. Norms, XOR Lemmas, and Lower Bounds for Polynomials and Protocols , 2008, Theory Comput..
[10] Satyanarayana V. Lokam,et al. Communication Complexity of Simultaneous Messages , 2003, SIAM J. Comput..
[11] Arkadev Chattopadhyay,et al. Multiparty Communication Complexity of Disjointness , 2008, Electron. Colloquium Comput. Complex..
[12] T. Pitassi,et al. Integrality gaps of 2 - o(1) for Vertex Cover SDPs in the Lovész-Schrijver Hierarchy , 2007, FOCS 2007.
[13] Ran Raz,et al. The BNS-Chung criterion for multi-party communication complexity , 2000, computational complexity.
[14] Noga Alon,et al. The Space Complexity of Approximating the Frequency Moments , 1999 .
[15] Alexander A. Sherstov. Communication Lower Bounds Using Dual Polynomials , 2008, Bull. EATCS.
[16] Alfred V. Aho,et al. On notions of information transfer in VLSI circuits , 1983, STOC.
[17] Thomas P. Hayes,et al. The Cost of the Missing Bit: Communication Complexity with Help , 2001, Comb..
[18] Jirí Sgall,et al. Some bounds on multiparty communication complexity of pointer jumping , 1998, computational complexity.
[19] Toniann Pitassi,et al. Lower Bounds for Lov[a-acute]sz--Schrijver Systems and Beyond Follow from Multiparty Communication Complexity , 2007, SIAM J. Comput..
[20] Emanuele Viola,et al. One-way multiparty communication lower bound for pointer jumping with applications , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).
[21] Andrew Chi-Chih Yao,et al. ON ACC and threshold circuits , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[22] Richard Beigel,et al. On ACC , 1994, computational complexity.
[23] Noam Nisan,et al. Pointer jumping requires concurrent read , 1997, STOC '97.
[24] Emanuele Viola. Pseudorandom Bits for Constant-Depth Circuits with Few Arbitrary Symmetric Gates , 2007, SIAM J. Comput..
[25] Zvi Galil,et al. Lower Bounds on Communication Complexity , 1987, Inf. Comput..
[26] Joshua Brody. The Maximum Communication Complexity of Multi-Party Pointer Jumping , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.
[27] 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..
[28] Richard J. Lipton,et al. Multi-party protocols , 1983, STOC.
[29] Toniann Pitassi,et al. Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity , 2007, ICALP.
[30] Eyal Kushilevitz,et al. Communication Complexity , 1997, Adv. Comput..
[31] Noam Nisan,et al. Rounds in Communication Complexity Revisited , 1993, SIAM J. Comput..
[32] Johan Håstad,et al. On the power of small-depth threshold circuits , 1991, computational complexity.
[33] Emanuele Viola,et al. Improved Separations between Nondeterministic and Randomized Multiparty Communication , 2008, TOCT.
[34] Joshua Brody,et al. Sublinear Communication Protocols for Multi-Party Pointer Jumping and a Related Lower Bound , 2008, STACS.
[35] Andrew Chi-Chih Yao,et al. Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.
[36] Andrej Bogdanov,et al. Hardness Amplification for Errorless Heuristics , 2007, FOCS 2007.
[37] Noam Nisan,et al. Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs , 1992, J. Comput. Syst. Sci..
[38] A. Chattopadhyay. Discrepancy and the Power of Bottom Fan-in in Depth-three Circuits , 2007, FOCS 2007.
[39] Alexander A. Sherstov. The pattern matrix method for lower bounds on quantum communication , 2008, STOC '08.
[40] Ronald de Wolf,et al. A Hypercontractive Inequality for Matrix-Valued Functions with Applications to Quantum Computing and LDCs , 2007, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.
[41] Fan Chung Graham,et al. Communication Complexity and Quasi Randomness , 1993, SIAM J. Discret. Math..