human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge groups authors who co-authored the same paper.

Details of the hypergraph:
Center hyperedge (induced by source paper "The NOF multiparty communication complexity of composed functions"):
  Abstract: We study the k-party ‘number on the forehead' communication complexity of composed functions f∘g, where f:{0,1}n→{±1}, g : {0,1}k→{0,1} and for (x1,…,xk)∈({0,1}n)k, f∘g(x1,…,xk)=f(…,g(x1,i,…,xk,i), …). We show that there is an O(log3n) cost simultaneous protocol for $\textnormal{\textsc{sym}} \circ g$ when k>1+logn, $\textnormal{\textsc{sym}}$ is any symmetric function and g is any function. Previously, an efficient protocol was only known for $\textnormal{\textsc{sym}} \circ g$ when g is symmetric and "compressible". We also get a non-simultaneous protocol for $\textnormal{\textsc{sym}} \circ g$ of cost O((n/2k) logn+k logn) for any k≥2.

In the setting of k≤1+logn, we study more closely functions of the form $\textnormal{\textsc{majority}} \circ g$, $\textnormal{\textsc{mod}}_m \circ g$, and $\textnormal{\textsc{nor}} \circ g$, where the latter two are generalizations of the well-known and studied functions Generalized Inner Product and Disjointness respectively. We characterize the communication complexity of these functions with respect to the choice of g. As the main application of our results, we answer a question posed by Babai et al. (SIAM Journal on Computing, 33:137---166, 2004) and determine the communication complexity of $\textnormal{\textsc{majority}} \circ \textnormal{\textsc{qcsb}}_k$, where $\textnormal{\textsc{qcsb}}_k$ is the "quadratic character of the sum of the bits" function.

Includes members:
  Member "Disjointness is Hard in the Multiparty Number-on-the-Forehead Model":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming")

Question: Please tell me which research area the co-authored paper (i.e., the source paper of the center hyperedge) belongs to. The 4 classes are: Computer science, Mathematics, Engineering, Economics, Psychology, Business. Directly output the class name.

gpt: Mathematics