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 "the fine grained complexity of computing the tutte polynomial of a linear matroid"):
  Abstract: We show that computing the Tutte polynomial of a linear matroid of dimension $k$ on $k^{O(1)}$ points over a field of $k^{O(1)}$ elements requires $k^{\Omega(k)}$ time unless the #ETH---a counting extension of the Exponential Time Hypothesis of Impagliazzo and Paturi [CCC 1999] due to Dell et al. [ACM TALG 2014]---is false. This holds also for linear matroids that admit a representation where every point is associated to a vector with at most two nonzero coordinates. Moreover, we also show that the same is true for computing the Tutte polynomial of a binary matroid of dimension $k$ on $k^{O(1)}$ points with at most three nonzero coordinates in each point's vector. These two results stand in sharp contrast to computing the Tutte polynomial of a $k$-vertex graph (that is, the Tutte polynomial of a graphic matroid of dimension $k$---which is representable in dimension $k$ over the binary field so that every vector has exactly two nonzero coordinates), which is known to be computable in $2^k k^{O(1)}$ time [Bj\"orklund et al., FOCS 2008]. Our lower-bound proofs proceed in three steps: (i) a classic connection due to Crapo and Rota [1970] between the number of tuples of codewords of full support and the Tutte polynomial of the matroid associated with the code; (ii) an earlier-established \#ETH-hardness of counting the solutions to a bipartite $(d,2)$-CSP on $n$ vertices in $d^{o(n)}$ time; and (iii) new embeddings of such CSP instances as questions about codewords of full support in a linear code. We complement these lower bounds with a matching upper-bound algorithm design that computes the Tutte polynomial of a linear matroid of dimension $k$ on $k^{O(1)}$ points in $k^{O(k)}$ arithmetic operations in the base field.

Includes members:
  Member "fine grained dichotomies for the tutte plane and boolean csp":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "parameterized counting of trees forests and matroid bases")
  Member "tight lower bounds on graph embedding problems":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "hedonic seat arrangement problems")
  Member "assigning channels via the meet in the middle approach":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "tight lower bound for the channel assignment problem")
  Member "exponential time complexity of the permanent and the tutte polynomial":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "lower bounds for the happy coloring problems")
  Member "inapproximability of the tutte polynomial":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "counting perfect matchings and the eight vertex model")
  Member "computing the tutte polynomial in vertex exponential time":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "the exact complexity of the tutte polynomial")

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)