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: "exact affine obdds"
  Abstract: We introduce affine OBDD model and we show that exact affine OBDDs can be exponentially narrower than bounded-error quantum and classical OBDDs on some certain problems. Moreover, we consider Las-Vegas quantum and classical automata models and improve the previous gap between deterministic and probabilistic models by a factor of 2 and then follow the same gap for the known most restricted quantum model. Lastly, we follow an exponential gap between exact affine finite automata and Las-Vegas classical and quantum models.

Connected through hyperedge HE-1 (induced by source paper "quantum online streaming algorithms with constant number of advice bits"):
  with members:
    - "quantum online algorithms with respect to space complexity"
    - "quantum versus classical online streaming algorithms with logarithmic size of memory"
    - "reordering method and hierarchies for quantum and classical ordered binary decision diagrams"
    - "very narrow quantum obdds and width hierarchies for classical obdds"
    - "the frequent items problem in online streaming under various performance measures"
    - "superiority of exact quantum automata for promise problems"
    - "a comparison of performance measures for online algorithms"

Connected through hyperedge HE-2 (induced by source paper "quantum versus classical online streaming algorithms with logarithmic size of memory"):
  with members:
    - "quantum online algorithms with respect to space complexity"
    - "lower bound and hierarchies for quantum ordered read k times branching programs"
    - "reordering method and hierarchies for quantum and classical ordered binary decision diagrams"
    - "nondeterministic unitary obdds"
    - "automata and quantum computing"
    - "unary probabilistic and quantum automata on promise problems"
    - "very narrow quantum obdds and width hierarchies for classical obdds"
    - "the frequent items problem in online streaming under various performance measures"

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)