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: "the complexity of propositional implication"
  Abstract: The question whether a set of formulae @C implies a formula @f is fundamental. The present paper studies the complexity of the above implication problem for propositional formulae that are built from a systematically restricted set of Boolean connectives. We give a complete complexity-theoretic classification for all sets of Boolean functions in the meaning of Post's lattice and show that the implication problem is efficiently solvable only if the connectives are definable using the constants {0,1} and only one of {@?,@?,@?}. The problem remains coNP-complete in all other cases. We also consider the restriction of @C to singletons which makes the problem strictly easier in some cases.

Connected through hyperedge HE-1 (induced by source paper "strong backdoors for default logic"):
  with members:
    - "backdoors to normality for disjunctive logic programs"
    - "satisfiability of acyclic and almost acyclic cnf formulas"
    - "backdoors to abduction"
    - "backdoors to satisfaction"
    - "backdoors to tractable answer set programming"

Connected through hyperedge HE-2 (induced by source paper "the weight in enumeration"):
  with members:
    - "the complexity of weighted and unweighted csp"
    - "complexity classifications for different equivalence and audit problems for boolean circuits"
    - "complexity classifications for propositional abduction in post s framework"

Connected through hyperedge HE-3 (induced by source paper "generalized satisfiability for the description logic alc"):
  with members:
    - "the complexity of satisfiability for fragments of hybrid logic part i"
    - "the complexity of satisfiability for sub boolean fragments of alc"
    - "the dl lite family and relations"
    - "generalized modal satisfiability"
    - "the complexity of generalized satisfiability for linear temporal logic"

Connected through hyperedge HE-4 (induced by source paper "generalized complexity of alc subsumption"):
  with members:
    - "generalized satisfiability for the description logic alc"
    - "the complexity of reasoning for fragments of autoepistemic logic"
    - "the complexity of satisfiability for sub boolean fragments of alc"
    - "the complexity of reasoning for fragments of default logic"

Connected through hyperedge HE-5 (induced by source paper "on the parameterized complexity of default logic and autoepistemic logic"):
  with members:
    - "complexity of non monotonic logics"

Connected through hyperedge HE-6 (induced by source paper "on the applicability of post s lattice"):
  with members:
    - "the complexity of satisfiability for fragments of hybrid logic part i"
    - "the complexity of reasoning for fragments of autoepistemic logic"
    - "the complexity of reasoning for fragments of default logic"
    - "generalized modal satisfiability"
    - "the complexity of generalized satisfiability for linear temporal logic"
    - "the tractability of model checking for ltl the good the bad and the ugly fragments"

Connected through hyperedge HE-7 (induced by source paper "the complexity of reasoning for fragments of autoepistemic logic"):
  with members:
    - "complexity of propositional abduction for restricted sets of boolean functions"
    - "the complexity of reasoning for fragments of default logic"
    - "the tractability of model checking for ltl the good the bad and the ugly fragments"

Connected through hyperedge HE-8 (induced by source paper "complexity of non monotonic logics"):
  with members:
    - "the complexity of reasoning for fragments of autoepistemic logic"
    - "complexity of propositional abduction for restricted sets of boolean functions"
    - "the complexity of reasoning for fragments of default logic"

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)