scientific article; zbMATH DE number 7559097

DOI10.4230/LIPIcs.ITCS.2019.54MaRDI QIDQ5090432

Adi Shraibman, Nathan Linial, Toniann Pitassi

Publication date: 18 July 2022

Full work available at URL: https://arxiv.org/abs/1706.02207

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

additive combinatoricsnumber on the forehead modelhigh dimensional permutations

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Larger Corner-Free Sets from Better NOF Exactly-$N$ Protocols ⋮ Nondeterministic and randomized Boolean hierarchies in communication complexity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new proof of the density Hales-Jewett theorem
• An upper bound on the number of high-dimensional permutations
• The NOF multiparty communication complexity of composed functions
• On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
• A new proof of the graph removal lemma
• On the power of small-depth threshold circuits
• The cost of the missing bit: Communication complexity with help
• Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
• On the ratio of optimal integral and fractional covers
• The BNS lower bound for multi-party protocols is nearly optimal
• An improved construction of progression-free sets
• A density version of the Hales-Jewett theorem
• Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition
• On the size of Kakeya sets in finite fields
• Lower Bounds for Lovász–Schrijver Systems and Beyond Follow from Multiparty Communication Complexity
• On a two-dimensional analogue of Szemerédi's theorem in Abelian groups
• On the uniform-traffic capacity of single-hop interconnections employing shared directional multichannels
• Testing subgraphs in large graphs
• Simple analysis of graph tests for linearity and PCP
• Communication Complexity
• Nearly complete graphs decomposable into large induced matchings and their applications
• Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
• The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems
• On Certain Sets of Integers
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression

This page was built for publication: