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 "quantum versus classical online streaming algorithms with logarithmic size of memory"):
  Abstract: We consider online algorithms with respect to the competitive ratio. Here, we investigate quantum and classical one-way automata with non-constant size of memory (streaming algorithms) as a model for online algorithms. We construct problems that can be solved by quantum online streaming algorithms better than by classical ones in a case of logarithmic or sublogarithmic size of memory.

Includes members:
  Member "quantum online algorithms with respect to space complexity":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "quantum online streaming algorithms with constant number of advice bits")
  Member "lower bound and hierarchies for quantum ordered read k times branching programs":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "new size hierarchies for two way automata")
  Member "exact affine obdds":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "quantum online streaming algorithms with constant number of advice bits")
  Member "reordering method and hierarchies for quantum and classical ordered binary decision diagrams":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "quantum online streaming algorithms with constant number of advice bits")
  Member "nondeterministic unitary obdds":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "lower bound and hierarchies for quantum ordered read k times branching programs")
  Member "automata and quantum computing":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "nonuniform families of polynomial size quantum finite automata and quantum logarithmic space computation with polynomial size advice")
  Member "unary probabilistic and quantum automata on promise problems":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "quantum finite automata survey status and research directions")
  Member "very narrow quantum obdds and width hierarchies for classical obdds":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "language recognition power and succinctness of affine automata")

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)