human: Given a node-centered hypergraph: <hypergraph>, where nodes represent authors and hyperedges represent groups of authors who co-authored the same paper.

Details of the hypergraph:
Center node: "Taming the Curse of Dimensionality: Discrete Integration by Hashing and Optimization"
  Abstract: Integration is affected by the curse of dimensionality and quickly becomes intractable as the dimensionality of the problem grows. We propose a randomized algorithm that, with high probability, gives a constant-factor approximation of a general discrete integral defined over an exponentially large set. This algorithm relies on solving only a small number of instances of a discrete combinatorial optimization problem subject to randomly generated parity constraints used as a hash function. As an application, we demonstrate that with a small number of MAP queries we can efficiently approximate the partition function of discrete graphical models, which can in turn be used, for instance, for marginal computation or model selection.

Connected through hyperedge HE-1 (induced by source paper "Putting MRFs on a Tensor Train"):
  with members:
    (none)

Connected through hyperedge HE-2 (induced by source paper "A Decidable Dichotomy Theorem on Directed Graph Homomorphisms with Non-negative Weights"):
  with members:
    - "The Computational Structure of Monotone Monadic SNP and Constraint Satisfaction: A Study through Datalog and Group Theory"
    - "Improved FPTAS for Multi-spin Systems"

Question: Please tell me which research area the center author belongs to. The 4 classes are: Computer science, Mathematics, Engineering, Economics, Psychology, Business. Directly output the class name.

gpt: Mathematics