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 "enumerating models of dnf faster breaking the dependency on the formula size"):
  Abstract: In this article, we study the problem of enumerating the models of DNF formulas. The aim is to provide enumeration algorithms with a delay that depends polynomially on the size of each model and not on the size of the formula. We succeed for two subclasses of DNF formulas: we provide a constant delay algorithm for $k$-DNF with fixed $k$ by an appropriate amortization method and we give a polynomial delay algorithm for monotone formulas. We then focus on the average delay of enumeration algorithms and show that we can bring down the dependency of the average delay to the square root of the formula size and even to a logarithmic dependency for monotone formulas.

Includes members:
  Member "a circuit based approach to efficient enumeration":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "efficient logspace classes for enumeration counting and uniform generation")
  Member "output polynomial enumeration on graphs of bounded local linear mim width":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "a meta algorithm for solving connectivity and acyclicity constraints on locally checkable properties parameterized by graph width measures")
  Member "efficient generation of stable planar cages for chemistry":
    also connected through other hyperedges:
      (none)
  Member "efficient enumeration of solutions produced by closure operations":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "neighborhood inclusions for minimal dominating sets enumeration linear and polynomial delay algorithms in p_7 free and p_8 free chordal graphs")
  Member "efficient algorithms for dualizing large scale hypergraphs":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "multi hop byzantine reliable broadcast with honest dealer made practical")

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)