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: "quantum function computation using sublogarithmic space abstract poster"
  Abstract: We prove that quantum Turing machines are strictly superior to probabilistic Turing machines in function computation for any space bound $ o(\log(n)) $.

Connected through hyperedge HE-1 (induced by source paper "quantum computation with write only memory"):
  with members:
    - "unbounded error quantum computation with small space bounds"
    - "languages recognized by nondeterministic quantum finite automata"

Connected through hyperedge HE-2 (induced by source paper "superiority of one way and realtime quantum machines and new directions"):
  with members:
    - "quantum counter automata"
    - "quantum computation with write only memory"
    - "probabilistic and quantum finite automata with postselection"
    - "classical and quantum computation with small space bounds phd thesis"
    - "two way finite automata with quantum and classical states"

Connected through hyperedge HE-3 (induced by source paper "classical and quantum computation with small space bounds phd thesis"):
  with members:
    - "unbounded error quantum computation with small space bounds"
    - "succinctness of two way probabilistic and quantum finite automata"
    - "language recognition by generalized quantum finite automata with unbounded error abstract poster"
    - "languages recognized by nondeterministic quantum finite automata"

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)