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 "instruction sequence based non uniform complexity classes"):
  Abstract: We present an approach to non-uniform complexity in which single-pass instruction sequences play a key part, and answer various questions that arise from this approach. We introduce several kinds of non-uniform complexity classes. One kind includes a counterpart of the well-known non-uniform complexity class P/poly and another kind includes a counterpart of the well-known non-uniform complexity class NP/poly. Moreover, we introduce a general notion of completeness for the non-uniform complexity classes of the latter kind. We also formulate a counterpart of the well-known complexity theoretic conjecture that NP is not included in P/poly. We think that the presented approach opens up an additional way of investigating issues concerning non-uniform complexity.

Includes members:
  Member "instruction sequence processing operators":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "program algebra for turing machine programs")
  Member "on the expressiveness of single pass instruction sequences":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "quantitative expressiveness of instruction sequence classes for computation on single bit registers")
  Member "indirect jumps improve instruction sequence performance":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "quantitative expressiveness of instruction sequence classes for computation on single bit registers")
  Member "an instruction sequence semigroup with involutive anti automorphisms":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "instruction sequence expressions for the secure hash algorithm sha 256")
  Member "instruction sequences and non uniform complexity theory":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "bitcoin a money like informational commodity")

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)