On the communication complexity of high-dimensional permutations

Recommendations

The NOF multiparty communication complexity of composed functions
Larger Corner-Free Sets from Better NOF Exactly-$N$ Protocols
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
A note on multiparty communication complexity and the Hales-Jewett theorem
The NOF multiparty communication complexity of composed functions

Cites work

A course in combinatorics.
A density version of the Hales-Jewett theorem
A new proof of the density Hales-Jewett theorem
A new proof of the graph removal lemma
Additive combinatorics: with a view towards computer science and cryptography -- an exposition
An upper bound on the number of high-dimensional permutations
Communication Complexity
scientific article; zbMATH DE number 5130813 (Why is no real title available?)
scientific article; zbMATH DE number 46958 (Why is no real title available?)
scientific article; zbMATH DE number 3473781 (Why is no real title available?)
scientific article; zbMATH DE number 3609704 (Why is no real title available?)
scientific article; zbMATH DE number 2209746 (Why is no real title available?)
Lower Bounds for Lovász–Schrijver Systems and Beyond Follow from Multiparty Communication Complexity
Multiparty protocols, pseudorandom generators for Logspace, and time- space trade-offs
Nearly complete graphs decomposable into large induced matchings and their applications
On a two-dimensional analogue of Szemerédi's theorem in Abelian groups
On Certain Sets of Integers
On large subsets of $\mathbb{F}_q^n$ with no three-term arithmetic progression
On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
On the power of small-depth threshold circuits
On the ratio of optimal integral and fractional covers
On the size of Kakeya sets in finite fields
On the uniform-traffic capacity of single-hop interconnections employing shared directional multichannels
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
Simple analysis of graph tests for linearity and PCP
Testing subgraphs in large graphs
The BNS lower bound for multi-party protocols is nearly optimal
The cost of the missing bit: Communication complexity with help
The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems
The NOF multiparty communication complexity of composed functions

Cited in

(6)

Nondeterministic and randomized Boolean hierarchies in communication complexity
Larger Corner-Free Sets from Better NOF Exactly-$N$ Protocols
On The Communication Complexity of High-Dimensional Permutations
Nondeterministic and randomized Boolean hierarchies in communication complexity
An improved protocol for ExactlyN with more than 3 players
Patterns in multi-dimensional permutations

This page was built for publication: On the communication complexity of high-dimensional permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5090432)