Results 251 to 260 of about 5,642,848 (291)
Some of the next articles are maybe not open access.
On the complexity of communication complexity
Proceedings of the forty-first annual ACM symposium on Theory of computing, 2009We consider the following question: given a two-argument boolean function f, represented as an N x N binary matrix, how hard is it to determine the (deterministic) communication complexity of f?We address two aspects of this question. On the computational side, we prove that, under appropriate cryptographic assumptions (such as the intractability of ...
Eyal Kushilevitz, Enav Weinreb
openaire +1 more source
Mathematics and Computation, 2019
Introduction to Communication Complexity, a framework to better understand the algorithmic computational complexity. We will use it to prove lower bounds for Testers and Streaming algorithms.
M. D. Rougemont
semanticscholar +1 more source
Introduction to Communication Complexity, a framework to better understand the algorithmic computational complexity. We will use it to prove lower bounds for Testers and Streaming algorithms.
M. D. Rougemont
semanticscholar +1 more source
On the Communication Complexity of AND Functions
IEEE Transactions on Information Theory, 2021Log-rank conjecture is one of challenging problems in communication complexity. It is known to hold for some special function classes such as XOR functions $\text {f}(\text {x}\oplus \text {y})$ when the outer function f is monotone, symmetric, $\mathsf {AC}^{0}$ , low $\mathbb {F}_{2}$ -degree, linear threshold or read-k.
openaire +1 more source
Round Elimination in Exact Communication Complexity
Theory of Quantum Computation, Communication, and Cryptography, 2018We study two basic graph parameters, the chromatic number and the orthogonal rank, in the context of classical and quantum exact communication complexity.
J. Briët +4 more
semanticscholar +1 more source
Interactional Complexity and Communication
Family Process, 1984This paper draws attention to an over‐simplification that we believe has been frequently made in the analysis of interpersonal communication. This happens when one uses interpersonal communication models that do not match the interactional complexity of the system under observation.
C, Ricci, M, Selvini-Palazzoli
openaire +2 more sources
On the communication complexity of polling
Information Processing Letters, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Privacy and communication complexity
30th Annual Symposium on Foundations of Computer Science, 1989After a short introduction, in paragraph 2, the author presents the model and the definition of privacy. In paragraph 3 he gives a characterization of the privately computable functions, and in paragraph 4 he deals with the communication complexity and rounds complexity of these functions.
openaire +2 more sources
Optimal Communication Complexity of Authenticated Byzantine Agreement
International Symposium on Distributed Computing, 2021Atsuki Momose, Ling Ren
semanticscholar +1 more source
High-Threshold AVSS with Optimal Communication Complexity
IACR Cryptology ePrint Archive, 2021Nicolas Alhaddad +2 more
semanticscholar +1 more source