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: "algorithms for testing monomials in multivariate polynomials"
  Abstract: This paper is our second step towards developing a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by an arithmetic circuit has some types of monomials in its sum-product expansion. The complexity aspects of this problem and its variants have been investigated in our first paper by Chen and Fu (2010), laying a foundation for further study. In this paper, we present two pairs of algorithms. First, we prove that there is a randomized $O^*(p^k)$ time algorithm for testing $p$-monomials in an $n$-variate polynomial of degree $k$ represented by an arithmetic circuit, while a deterministic $O^*(6.4^k + p^k)$ time algorithm is devised when the circuit is a formula, here $p$ is a given prime number. Second, we present a deterministic $O^*(2^k)$ time algorithm for testing multilinear monomials in $\Pi_m\Sigma_2\Pi_t\times \Pi_k\Pi_3$ polynomials, while a randomized $O^*(1.5^k)$ algorithm is given for these polynomials. The first algorithm extends the recent work by Koutis (2008) and Williams (2009) on testing multilinear monomials. Group algebra is exploited in the algorithm designs, in corporation with the randomized polynomial identity testing over a finite field by Agrawal and Biswas (2003), the deterministic noncommunicative polynomial identity testing by Raz and Shpilka (2005) and the perfect hashing functions by Chen {\em at el.} (2007). Finally, we prove that testing some special types of multilinear monomial is W[1]-hard, giving evidence that testing for specific monomials is not fixed-parameter tractable.

Connected through hyperedge HE-1 (induced by source paper "monomial testing and applications"):
  with members:
    - "towards randomized testing of q monomials in multivariate polynomials"
    - "the complexity of testing 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"

Connected through hyperedge HE-2 (induced by source paper "towards randomized testing of q monomials in multivariate polynomials"):
  with members:
    - "the complexity of testing 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"

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

Connected through hyperedge HE-4 (induced by source paper "approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials"):
  with members:
    - "the complexity of 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:
    - "the complexity of testing monomials in multivariate polynomials"
    - "approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials"

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)