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: "homogeneous formulas and symmetric polynomials"
  Abstract: We investigate the arithmetic formula complexity of the elementary symmetric polynomials S(k,n). We show that every multilinear homogeneous formula computing S(k,n) has size at least k^(Omega(log k))n, and that product-depth d multilinear homogeneous formulas for S(k,n) have size at least 2^(Omega(k^{1/d}))n. Since S(n,2n) has a multilinear formula of size O(n^2), we obtain a superpolynomial separation between multilinear and multilinear homogeneous formulas. We also show that S(k,n) can be computed by homogeneous formulas of size k^(O(log k))n, answering a question of Nisan and Wigderson. Finally, we present a superpolynomial separation between monotone and non-monotone formulas in the noncommutative setting, answering a question of Nisan.

Connected through hyperedge HE-1 (induced by source paper "new exponential size lower bounds against depth four circuits of bounded individual degree"):
  with members:
    - "small depth multilinear formula lower bounds for iterated matrix multiplication with applications"
    - "on the power of homogeneous depth 4 arithmetic circuits"
    - "depth 4 lower bounds determinantal complexity a unified approach"

Connected through hyperedge HE-2 (induced by source paper "schur polynomials do not have small formulas if the determinant doesn t"):
  with members:
    - "closure of vp under taking factors a short and simple proof"
    - "some closure results for polynomial factorization and applications"
    - "discovering the roots uniform closure results for algebraic classes under factoring"
    - "rectangular kronecker coefficients and plethysms in geometric complexity theory"

Connected through hyperedge HE-3 (induced by source paper "fast exact algorithms using hadamard product of polynomials"):
  with members:
    - "on the hardness of the noncommutative determinant"
    - "arithmetic circuits and the hadamard product of polynomials"
    - "balanced families of perfect hash functions and their applications"

Connected through hyperedge HE-4 (induced by source paper "small depth multilinear formula lower bounds for iterated matrix multiplication with applications"):
  with members:
    - "the average sensitivity of bounded depth formulas"
    - "on the power of homogeneous depth 4 arithmetic circuits"
    - "improved bounds for reduction to depth 4 and depth 3"

Connected through hyperedge HE-5 (induced by source paper "lower bounds for monotone counting circuits"):
  with members:
    - "lower bounds for tropical circuits and dynamic programs"

Connected through hyperedge HE-6 (induced by source paper "applications of monotone rank to complexity theory"):
  with members:
    - "monotone rank and separations in computational complexity"
    - "tensor rank some lower and upper bounds"
    - "partition arguments in multiparty communication complexity"
    - "on the complexity of nonnegative matrix factorization"

Connected through hyperedge HE-7 (induced by source paper "monotone rank and separations in computational complexity"):
  with members:
    - "tensor rank some lower and upper bounds"
    - "arithmetic circuits and the hadamard product of polynomials"
    - "on the complexity of nonnegative matrix factorization"

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)