Extension Complexity of Polytopes

[1]  Amir Yehudayoff,et al.  Pointer chasing via triangular discrimination , 2020, Combinatorics, Probability and Computing.

[2]  Arkadev Chattopadhyay,et al.  Simulation Theorems via Pseudo-random Properties , 2017, computational complexity.

[3]  Alex Samorodnitsky.  An Inequality for Functions on the Hamming Cube , 2017, Comb. Probab. Comput..

[4]  Anup Rao,et al.  Non-Adaptive Data Structure Lower Bounds for Median and Predecessor Search from Sunflowers , 2017, Electron. Colloquium Comput. Complex..

[5]  Alexander A. Sherstov.  Compressing Interactive Communication under Product Distributions , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[6]  Anup Rao,et al.  Simplified Separation of Information and Communication , 2015, Electron. Colloquium Comput. Complex..

[7]  Gillat Kol.  Interactive compression for product distributions , 2015, Electron. Colloquium Comput. Complex..

[8]  Robin Kothari.  Nearly optimal separations between communication (or query) complexity and partitions , 2015, Computational Complexity Conference.

[9]  Toniann Pitassi,et al.  Deterministic Communication vs. Partition Number , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[10]  Michel X. Goemans,et al.  Smallest compact formulation for the permutahedron , 2015, Math. Program..

[11]  Anup Rao,et al.  Circuits with Medium Fan-In , 2015, Computational Complexity Conference.

[12]  Anup Rao,et al.  Simplified Lower Bounds on the Multiparty Communication Complexity of Disjointness , 2015, Computational Complexity Conference.

[13]  Ran Raz,et al.  Exponential Separation of Information and Communication for Boolean Functions , 2015, STOC.

[14]  Alexander A. Sherstov.  Communication Lower Bounds Using Directional Derivatives , 2014, JACM.

[15]  Mikkel Thorup,et al.  Dynamic Integer Sets with Optimal Rank, Select, and Predecessor Search , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[16]  Fabian Kuhn,et al.  On the power of the congested clique model , 2014, PODC.

[17]  B. Szegedy.  An information theoretic approach to Sidorenko's conjecture , 2014, 1406.6738.

[18]  Thomas Rothvoß,et al.  The matching polytope has exponential extension complexity , 2013, STOC.

[19]  Shachar Lovett,et al.  Communication is bounded by root of rank , 2013, STOC.

[20]  Stasys Jukna,et al.  Boolean Function Complexity Advances and Frontiers , 2012, Bull. EATCS.

[21]  Mark Braverman,et al.  Public vs Private Coin in Bounded-Round Information , 2014, ICALP.

[22]  Shachar Lovett,et al.  En Route to the Log-Rank Conjecture: New Reductions and Equivalent Formulations , 2014, ICALP.

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

[24]  Mark Braverman,et al.  Direct Products in Communication Complexity , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[25]  Mark Braverman,et al.  An information complexity approach to extended formulations , 2013, STOC '13.

[26]  Nikolai K. Vereshchagin,et al.  Towards a Reverse Newman’s Theorem in Interactive Information Complexity , 2013, 2013 IEEE Conference on Computational Complexity.

[27]  Mikhail Kapralov,et al.  Better bounds for matchings in the streaming model , 2012, SODA.

[28]  Pavel Hrubes.  A note on semantic cutting planes , 2013, Electron. Colloquium Comput. Complex..

[29]  Misha Gromov,et al.  In a Search for a Structure, Part 1: On Entropy , 2013 .

[30]  Roger Wattenhofer,et al.  Optimal distributed all pairs shortest paths and applications , 2012, PODC '12.

[31]  Mark Braverman,et al.  Interactive information complexity , 2012, STOC '12.

[32]  Ashish Goel,et al.  On the communication and streaming complexity of maximum bipartite matching , 2012, SODA.

[33]  Roger Wattenhofer,et al.  Networks cannot compute their diameter in sublinear time , 2012, SODA.

[34]  Hans Raj Tiwary,et al.  Extended Formulations for Polygons , 2011, Discret. Comput. Geom..

[35]  Emanuele Viola,et al.  The communication complexity of addition , 2013, Comb..

[36]  Alexander A. Sherstov.  The Communication Complexity of Gap Hamming Distance , 2012, Theory Comput..

[37]  Mihai Pa caron,et al.  Unifying the Landscape of Cell-Probe Lower Bounds , 2011 .

[38]  Amit Chakrabarti,et al.  An optimal lower bound on the communication complexity of gap-hamming-distance , 2010, STOC '11.

[39]  Thomas Vidick,et al.  A concentration inequality for the overlap of a vector on a large set, with application to the communication complexity of the Gap-Hamming-Distance problem , 2011, Chic. J. Theor. Comput. Sci..

[40]  Jaikumar Radhakrishnan,et al.  An entropy based proof of the Moore bound for irregular graphs , 2010, ArXiv.

[41]  Yuval Filmus,et al.  Triangle-intersecting Families of Graphs , 2010 .

[42]  Xi Chen,et al.  How to compress interactive communication , 2010, STOC '10.

[43]  Jaikumar Radhakrishnan,et al.  The Communication Complexity of Correlation , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[44]  Thomas Holenstein.  Parallel Repetition: Simplification and the No-Signaling Case , 2006, Theory Comput..

[45]  Avi Wigderson,et al.  The Randomized Communication Complexity of Set Disjointness , 2007, Theory Comput..

[46]  Martin Dietzfelbinger,et al.  A characterization of average case communication complexity , 2007, Inf. Process. Lett..

[47]  Hartmut Klauck,et al.  One-way communication complexity and the Neciporuk lower bound on formula size , 2001, SIAM J. Comput..

[48]  Alexandr Andoni,et al.  On the Optimality of the Dimensionality Reduction Method , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[49]  Mikkel Thorup,et al.  Time-space trade-offs for predecessor search , 2006, STOC '06.

[50]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

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

[52]  David P. Woodruff,et al.  Tight lower bounds for the distinct elements problem , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[53]  Pranab Sen.  Lower bounds for predecessor searching in the cell probe model , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[54]  Satyanarayana V. Lokam,et al.  Communication Complexity of Simultaneous Messages , 2003, SIAM J. Comput..

[55]  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..

[56]  Faith Ellen,et al.  Optimal Bounds for the Predecessor Problem and Related Problems , 2002, J. Comput. Syst. Sci..

[57]  Noga Alon,et al.  The Moore Bound for Irregular Graphs , 2002, Graphs Comb..

[58]  Andrew Chi-Chih Yao,et al.  Informational complexity and the direct sum problem for simultaneous message complexity , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[59]  Vince Grolmusz.  Circuits and multi-party protocols , 1998, computational complexity.

[60]  Rafail Ostrovsky,et al.  Efficient search for approximate nearest neighbor in high dimensional spaces , 1998, STOC '98.

[61]  Pavel Pudlák,et al.  Lower bounds for resolution and cutting plane proofs and monotone computations , 1997, Journal of Symbolic Logic.

[62]  Jan Krajícek,et al.  Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic , 1997, Journal of Symbolic Logic.

[63]  Noga Alon,et al.  The space complexity of approximating the frequency moments , 1996, STOC '96.

[64]  Jaikumar Radhakrishnan,et al.  The Randomized Complexity of Maintaining the Minimum , 1996, Nord. J. Comput..

[65]  Peter Bro Miltersen,et al.  On data structures and asymmetric communication complexity , 1994, STOC '95.

[66]  N. Alon,et al.  Repeated communication and Ramsey graphs , 1994, Proceedings of 1994 IEEE International Symposium on Information Theory.

[67]  Noam Nisan,et al.  On rank vs. communication complexity , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[68]  Eli Upfal,et al.  Computing with Noisy Information , 1994, SIAM J. Comput..

[69]  Russell Impagliazzo,et al.  Upper and lower bounds for tree-like cutting planes proofs , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[70]  Rüdiger Reischuk,et al.  Different Modes of Communication , 1993, SIAM J. Comput..

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

[72]  A. Wigderson,et al.  Monotone circuits for matching require linear depth , 1992, JACM.

[73]  Nathan Linial,et al.  Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..

[74]  T. Feder,et al.  Amortized communication complexity , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

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

[76]  Ilan Newman,et al.  Private vs. Common Random Bits in Communication Complexity , 1991, Inf. Process. Lett..

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

[78]  Wojciech Szatzschneider,et al.  An Inequality , 1991, SIAM Rev..

[79]  Avi Wigderson,et al.  Composition of the Universal Relation , 1990, Advances In Computational Complexity Theory.

[80]  Noam Nisan,et al.  Multiparty protocols and logspace-hard pseudorandom sequences , 1989, STOC '89.

[81]  Michael E. Saks,et al.  The cell probe complexity of dynamic data structures , 1989, STOC '89.

[82]  Mihalis Yannakakis,et al.  Expressing combinatorial optimization problems by linear programs , 1991, STOC '88.

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

[84]  Michael E. Saks,et al.  Lattices, mobius functions and communications complexity , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[85]  Miklós Ajtai,et al.  A lower bound for finding predecessors in Yao's cell probe model , 1988, Comb..

[86]  Bala Kalyanasundaram,et al.  The Probabilistic Communication Complexity of Set Intersection , 1992, SIAM J. Discret. Math..

[87]  William J. Cook,et al.  On the complexity of cutting-plane proofs , 1987, Discret. Appl. Math..

[88]  Richard Cole,et al.  Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms , 1986, STOC '86.

[89]  David A. Mix Barrington,et al.  Bounded-width polynomial-size branching programs recognize exactly those languages in NC1 , 1986, STOC '86.

[90]  Peter Frankl,et al.  Complexity classes in communication complexity theory , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[91]  Fan Chung Graham,et al.  Some intersection theorems for ordered sets and graphs , 1986, J. Comb. Theory, Ser. A.

[92]  D. Grigor'ev,et al.  Lower bounds in algebraic computational complexity , 1985 .

[93]  Armin Haken,et al.  The Intractability of Resolution , 1985, Theor. Comput. Sci..

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

[95]  Alfred V. Aho,et al.  On notions of information transfer in VLSI circuits , 1983, STOC.

[96]  Richard J. Lipton,et al.  Multi-party protocols , 1983, STOC.

[97]  Andrew Chi-Chih Yao,et al.  Lower Bounds by Probabilistic Arguments (Extended Abstract) , 1983, FOCS 1983.

[98]  C. Thompson.  Area-time complexity for VLSI , 1979, STOC 1979.

[99]  Peter van Emde Boas,et al.  Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space , 1977, Inf. Process. Lett..

[100]  Jack Edmonds,et al.  Matroids and the greedy algorithm , 1971, Math. Program..

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

[102]  L. H. Harper.  Optimal numberings and isoperimetric problems on graphs , 1966 .

[103]  F. C. Hennie,et al.  One-Tape, Off-Line Turing Machine Computations , 1965, Inf. Control..

[104]  J. Hartmanis,et al.  On the Computational Complexity of Algorithms , 1965 .

[105]  J. A. Robinson,et al.  A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[106]  Michael J. Fischer,et al.  An improved equivalence algorithm , 1964, CACM.

[107]  A. Hales,et al.  Regularity and Positional Games , 1963 .

[108]  Claude E. Shannon,et al.  The synthesis of two-terminal switching circuits , 1949, Bell Syst. Tech. J..

[109]  J. Neumann.  Zur Theorie der Gesellschaftsspiele , 1928 .