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 curse and blessing of not all equal in k satisfiability"):
  Abstract: As a natural variant of the $k$-SAT problem, NAE-$k$-SAT additionally requires the literals in each clause to take not-all-equal (NAE) truth values. In this paper, we study the worst-case time complexities of solving NAE-$k$-SAT and MAX-NAE-$k$-SAT approximation, as functions of $k$, the number of variables $n$, and the performance ratio $\delta$. The latter problem asks for a solution of at least $\delta$ times the optimal. Our main results include:  (1) A deterministic algorithm for NAE-$k$-SAT that is faster than the best deterministic algorithm for $k$-SAT on all $k \ge 3$. Previously, no NAE-$k$-SAT algorithm is known to be faster than $k$-SAT algorithms. For $k = 3$, we achieve an upper bound of $1.326^n$. The corresponding bound for $3$-SAT is $1.328^n$.  (2) A randomized algorithm for MAX-NAE-$k$-SAT approximation, with upper bound $(2 - \epsilon_k(\delta))^n$ where $\epsilon_k(\delta) > 0$ only depends on $k$ and $\delta$. Previously, no upper bound better than the trivial $2^n$ is known for MAX-NAE-$k$-SAT approximation on $k \ge 4$. For $\delta = 0.9$ and $k = 4$, we achieve an upper bound of $1.947^n$.  (3) A deterministic algorithm for MAX-NAE-$k$-SAT approximation. For $\delta = 0.9$ and $k = 3$, we achieve an upper bound of $1.698^n$, which is better than the upper bound $1.731^n$ of the exact algorithm for MAX-NAE-$3$-SAT.  Our finding sheds new light on the following question: Is NAE-$k$-SAT easier than $k$-SAT? The answer might be affirmative at least on solving the problems exactly and deterministically, while approximately solving MAX-NAE-$k$-SAT might be harder than MAX-$k$-SAT on $k \ge 4$.

Includes members:
  Member "chain generalization of covering code and deterministic algorithm for k sat":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "improved efficiency for explicit covering codes matching the sphere covering bound")
  Member "powers of tensors and fast matrix multiplication":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "new algorithms and hardness for incremental single source shortest paths in directed graphs")

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)