Related papers: Composition theorems in communication complexity
Building meaningful representations of noun compounds is not trivial since many of them scarcely appear in the corpus. To that end, composition functions approximate the distributional representation of a noun compound by combining its…
Buhrman, Cleve and Wigderson (STOC'98) showed that for every Boolean function f : {-1,1}^n to {-1,1} and G in {AND_2, XOR_2}, the bounded-error quantum communication complexity of the composed function f o G equals O(Q(f) log n), where Q(f)…
The communication class $\mathbf{UPP}^{\text{cc}}$ is a communication analog of the Turing Machine complexity class $\mathbf{PP}$. It is characterized by a matrix-analytic complexity measure called sign-rank (also called dimension…
The first section starts with the basic definitions following mainly the notations of the book written by E. Kushilevitz and N. Nisan. At the end of the first section I examine tree-balancing. In the second section I summarize the…
We study the communication complexity of computing functions $F:\{0,1\}^n\times \{0,1\}^n \rightarrow \{0,1\}$ in the memoryless communication model. Here, Alice is given $x\in \{0,1\}^n$, Bob is given $y\in \{0,1\}^n$ and their goal is to…
The topic of gamma type functions and related functional equation $f(x+1)=g(x)f(x)$ has been seriously studied from first half of the twentieth century till now. Regarding unique solutions of the equation the asymptotic condition…
Since the seminal work of Paturi and Simon \cite[FOCS'84 & JCSS'86]{PS86}, the unbounded-error classical communication complexity of a Boolean function has been studied based on the arrangement of points and hyperplanes. Recently,…
Compositional generalization is the ability of a model to generalize to complex, previously unseen types of combinations of entities from just having seen the primitives. This type of generalization is particularly relevant to the semantic…
We extend some approach to a family of symmetric means (i.e. symmetric functions $\mathscr{M} \colon \bigcup_{n=1}^\infty I^n \to I$ with $\min\le \mathscr{M}\le \max$; $I$ is an interval). Namely, it is known that every symmetric mean can…
For locally compact Hausdorff spaces $X$ and $Y$, and function algebras $A$ and $B$ on $X$ and $Y$, respectively, surjections $T:A \longrightarrow B$ satisfying norm multiplicative condition $\|Tf\, Tg\|_Y =\|fg\|_X$, $f,g\in A$, with…
Proving formula depth lower bounds is a fundamental challenge in complexity theory, with the strongest known bound of $(3 - o(1))\log n$ established by Hastad over 25 years ago. The Karchmer-Raz-Wigderson (KRW) conjecture offers a promising…
A foundational theory of compositional categorical rewriting theory is presented, based on a collection of fibration-like properties that collectively induce and intrinsically structure the large collection of lemmata used in the proofs of…
Generalized probabilistic theories (GPT) provide a general framework that includes classical and quantum theories. It is described by a cone $C$ and its dual $C^*$. We show that whether some one-way communication complexity problems can be…
We show a partial Boolean function $f$ together with an input $x\in f^{-1}\left(*\right)$ such that both $C_{\bar{0}}\left(f,x\right)$ and $C_{\bar{1}}\left(f,x\right)$ are at least $C\left(f\right)^{2-o\left(1\right)}$. Due to recent…
This paper gives a nearly tight characterization of the quantum communication complexity of the permutation-invariant Boolean functions. With such a characterization, we show that the quantum and randomized communication complexity of the…
Let G be a possibly disconnected reductive group over a finite field with Frobenius map F. The main result of this paper is that the characteristic functions af "admissible complexes" A on G such that F^*A is isomorphic to A form a basis of…
It is known that the dynamics of $f$ and $g$ vary to a large extent from that of its composite entire functions. Using Approximation theory of entire functions, we have shown the existence of entire functions $f$ and $g$ having infinite…
We present connections between the recent literature on multigroup fairness for prediction algorithms and classical results in computational complexity. Multiaccurate predictors are correct in expectation on each member of an arbitrary…
In the context of learning to map an input $I$ to a function $h_I:\mathcal{X}\to \mathbb{R}$, two alternative methods are compared: (i) an embedding-based method, which learns a fixed function in which $I$ is encoded as a conditioning…
We find sufficient conditions on a compactly supported function $g$, $\supp g = [a,b]$ which guarantee that the Gabor system $$\mathcal{G}(g;\alpha,\beta)=\{e^{2\pi i \beta m x}g(x-\alpha n)\}_{m,n\in\mathbb{Z}}$$ is a frame for all $\alpha…