human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "derandomization and absolute reconstruction for sums of powers of linear forms"):
  Abstract: We study the decomposition of multivariate polynomials as sums of powers of linear forms. #R##N#Our main result is an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be written as a sum of cubes of linearly independent linear forms with complex coefficients. Compared to previous algorithms for the same problem, the two main novel features of this algorithm are: #R##N#(i) It is an algebraic algorithm, i.e., it performs only arithmetic operations and equality tests on the coefficients of the input polynomial. In particular, it does not make any appeal to polynomial factorization. #R##N#(ii) For an input polynomial with rational coefficients, the algorithm runs in polynomial time when implemented in the bit model of computation. #R##N#The algorithm relies on methods from linear and multilinear algebra (symmetric tensor decomposition by simultaneous diagonalization). #R##N#We also give a version of our algorithm for decomposition over the field of real numbers. In this case, the algorithm performs arithmetic operations and comparisons on the input coefficients. #R##N#Finally we give several related derandomization results on black box polynomial identity testing, the minimization of the number of variables in a polynomial, the computation of Lie algebras and factorization into products of linear forms.

Includes members:
  Member "isomorphism problems for tensors groups and cubic forms completeness and reductions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "general linear group action on tensors a candidate for post quantum cryptography")
  Member "orbits of monomials and factorization into products of linear forms":
    also connected through other hyperedges:
      (none)
  Member "algorithms based on algebras and their applications to isomorphism of polynomials with one secret group isomorphism and polynomial identity testing":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "general linear group action on tensors a candidate for post quantum cryptography")
  Member "reconstruction algorithms for sums of affine powers":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a nearly optimal algorithm to decompose binary forms")
  Member "a deterministic polynomial time algorithm for non commutative rational identity testing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "rigorous guarantees for tyler s m estimator via quantum expansion")
  Member "non commutative edmonds problem and matrix semi invariants":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "from independent sets and vertex colorings to isotropic spaces and isotropic decompositions")
  Member "quasipolynomial time identity testing of non commutative and read once oblivious algebraic branching programs":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "efficient black box identity testing over free group algebra")
  Member "symmetric tensor decomposition":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "sparse interpolation in terms of multivariate chebyshev polynomials")

Question: Please tell me which class the source paper 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)