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 "randomized query complexity of sabotaged and composed functions"):
  Abstract: We study the composition question for bounded-error randomized query complexity: Is R(f o g) = Omega(R(f) R(g)) for all Boolean functions f and g? We show that inserting a simple Boolean function h, whose query complexity is only Theta(log R(g)), in between f and g allows us to prove R(f o h o g) = Omega(R(f) R(h) R(g)). #R##N#We prove this using a new lower bound measure for randomized query complexity we call randomized sabotage complexity, RS(f). Randomized sabotage complexity has several desirable properties, such as a perfect composition theorem, RS(f o g) >= RS(f) RS(g), and a composition theorem with randomized query complexity, R(f o g) = Omega(R(f) RS(g)). It is also a quadratically tight lower bound for total functions and can be quadratically superior to the partition bound, the best known general lower bound for randomized query complexity. #R##N#Using this technique we also show implications for lifting theorems in communication complexity. We show that a general lifting theorem for zero-error randomized protocols implies a general lifting theorem for bounded-error protocols.

Includes members:
  Member "nearly optimal separations between communication or query complexity and partitions":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "optimal separation and strong direct sum for randomized query complexity")
  Member "a quadratically tight partition bound for classical communication complexity and query complexity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "nearly optimal separations between communication or query complexity and partitions")
  Member "composition limits and separating examples for some boolean function complexity measures":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a tight composition theorem for the randomized query complexity of partial functions")
  Member "a composition theorem for decision tree complexity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "a tight composition theorem for the randomized query complexity of partial functions")
  Member "improved direct product theorems for randomized query complexity":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a tight composition theorem for the randomized query complexity of partial functions")
  Member "optimal direct sum results for deterministic and randomized decision tree complexity":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "a tight composition theorem for the randomized query complexity of partial functions")
  Member "the partition bound for classical communication complexity and query complexity":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "query to communication lifting using low discrepancy gadgets")

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)