human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "the complexity of testing monomials in multivariate polynomials"
  Abstract: The work in this paper is to initiate a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by certain economically compact structure has a multilinear monomial in its sum-product expansion. The complexity aspects of this problem and its variants are investigated with two folds of objectives. One is to understand how this problem relates to critical problems in complexity, and if so to what extent. The other is to exploit possibilities of applying algebraic properties of polynomials to the study of those problems. A series of results about $\Pi\Sigma\Pi$ and $\Pi\Sigma$ polynomials are obtained in this paper, laying a basis for further study along this line.

Connected through hyperedge HE-1 (induced by source paper "monomial testing and applications"):
  with members:
    - "towards randomized testing of q monomials in multivariate polynomials"
    - "approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials"
    - "narrow sieves for parameterized paths and packings"
    - "determinant sums for undirected hamiltonicity"
    - "algorithms for testing monomials in multivariate polynomials"

Connected through hyperedge HE-2 (induced by source paper "towards randomized testing of q monomials in multivariate polynomials"):
  with members:
    - "approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials"
    - "narrow sieves for parameterized paths and packings"
    - "determinant sums for undirected hamiltonicity"
    - "algorithms for testing monomials in multivariate polynomials"

Connected through hyperedge HE-3 (induced by source paper "monomials in arithmetic circuits complete problems in the counting hierarchy"):
  with members:
    - "algebraic independence in positive characteristic a p adic calculus"
    - "approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials"
    - "interpolation in valiant s theory"

Connected through hyperedge HE-4 (induced by source paper "approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials"):
  with members:
    - "algorithms for testing monomials in multivariate polynomials"
    - "reducing randomness via irrational numbers"

Connected through hyperedge HE-5 (induced by source paper "multivariate polynomial integration and derivative are polynomial time inapproximable unless p np"):
  with members:
    - "approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials"
    - "algorithms for testing monomials in multivariate polynomials"

Connected through hyperedge HE-6 (induced by source paper "algorithms for testing monomials in multivariate polynomials"):
  with members:
    - "approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials"
    - "reducing randomness via irrational numbers"

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.CC(Computational Complexity)