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: "factoring bivariate lacunary polynomials without heights"
  Abstract: We present an algorithm which computes the multilinear factors of bivariate lacunary polynomials. It is based on a new Gap theorem which allows to test whether P(X)=∑kj=1 αjXαj(1+X)βjis identically zero in polynomial time. The algorithm we obtain is more elementary than the one by Kaltofen and Koiran (ISSAC'05) since it relies on the valuation of polynomials of the previous form instead of the height of the coefficients. As a result, it can be used to find some linear factors of bivariate lacunary polynomials over a field of large finite characteristic in probabilistic polynomial time.

Connected through hyperedge HE-1 (induced by source paper "what can and can t we do with sparse polynomials"):
  with members:
    - "bounded degree factors of lacunary multivariate polynomials"
    - "output sensitive algorithms for sumset and sparse polynomial multiplication"
    - "parallel sparse interpolation using small primes"
    - "sparse interpolation over finite fields via low order roots of unity"
    - "faster sparse multivariate polynomial interpolation of straight line programs"
    - "faster polynomial multiplication over finite fields"
    - "multivariate sparse interpolation using randomized kronecker substitutions"
    - "faster sparse interpolation of straight line programs"

Connected through hyperedge HE-2 (induced by source paper "bounded degree factors of lacunary multivariate polynomials"):
  with members:
    - "lacunaryx computing bounded degree factors of lacunary polynomials"
    - "a near optimal algorithm for computing real roots of sparse polynomials"
    - "computing low degree factors of lacunary polynomials a newton puiseux approach"
    - "even faster integer multiplication"
    - "computing the multilinear factors of lacunary polynomials without heights"
    - "on the intersection of a sparse curve and a low degree curve a polynomial version of the lost theorem"
    - "differential equations for algebraic functions"

Connected through hyperedge HE-3 (induced by source paper "lacunaryx computing bounded degree factors of lacunary polynomials"):
  with members:
    - "bounded degree factors of lacunary multivariate polynomials"
    - "computing low degree factors of lacunary polynomials a newton puiseux approach"
    - "computing the multilinear factors of lacunary polynomials without heights"

Connected through hyperedge HE-4 (induced by source paper "computing low degree factors of lacunary polynomials a newton puiseux approach"):
  with members:
    - "computing the multilinear factors of lacunary polynomials without heights"
    - "on the intersection of a sparse curve and a low degree curve a polynomial version of the lost theorem"

Connected through hyperedge HE-5 (induced by source paper "pseudorandomness for multilinear read once algebraic branching programs in any order"):
  with members:
    - "pseudorandomness for regular branching programs via fourier analysis"
    - "explicit noether normalization for simultaneous conjugation via polynomial identity testing"
    - "quasipolynomial time identity testing of non commutative and read once oblivious algebraic branching programs"
    - "on identity testing of tensors low rank recovery and compressed sensing"
    - "better pseudorandom generators from milder pseudorandom restrictions"
    - "quasi polynomial hitting set for set depth delta formulas"
    - "geometric complexity theory v equivalence between blackbox derandomization of polynomial identity testing and derandomization of noether s normalization lemma"
    - "blackbox identity testing for bounded top fanin depth 3 circuits the field doesn t matter"

Connected through hyperedge HE-6 (induced by source paper "computing the multilinear factors of lacunary polynomials without heights"):
  with members:
    - "pseudorandomness for multilinear read once algebraic branching programs in any order"
    - "a wronskian approach to the real tau conjecture"
    - "the limited power of powering polynomial identity testing and a depth four lower bound for the permanent"
    - "detecting lacunary perfect powers and computing their roots"

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)