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 "dual lower bounds for approximate degree and markov bernstein inequalities"):
  Abstract: The $\epsilon$-approximate degree of a Boolean function $f: \{-1, 1\}^n \to \{-1, 1\}$ is the minimum degree of a real polynomial that approximates $f$ to within $\epsilon$ in the $\ell_\infty$ norm. We prove several lower bounds on this important complexity measure by explicitly constructing solutions to the dual of an appropriate linear program. Our first result resolves the $\epsilon$-approximate degree of the two-level AND-OR tree for any constant $\epsilon > 0$. We show that this quantity is $\Theta(\sqrt{n})$, closing a line of incrementally larger lower bounds. The same lower bound was recently obtained independently by Sherstov using related techniques. Our second result gives an explicit dual polynomial that witnesses a tight lower bound for the approximate degree of any symmetric Boolean function, addressing a question of \v{S}palek. Our final contribution is to reprove several Markov-type inequalities from approximation theory by constructing explicit dual solutions to natural linear programs. These inequalities underly the proofs of many of the best-known approximate degree lower bounds, and have important uses throughout theoretical computer science.

Includes members:
  Member "hardness amplification and the approximate degree of constant depth circuits":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "near optimal lower bounds on the threshold degree and sign rank of ac 0")
  Member "open problems in analysis of boolean functions":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "algorithms for similarity search and pseudorandomness")
  Member "a separation of np and conp in multiparty communication complexity":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "a nearly optimal lower bound on the approximate degree of ac 0")
  Member "the intersection of two halfspaces has high threshold degree":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "near optimal lower bounds on the threshold degree and sign rank of ac 0")
  Member "multiparty communication complexity of disjointness":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "a nearly optimal lower bound on the approximate degree of ac 0")
  Member "a dual polynomial for or":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "near optimal lower bounds on the threshold degree and sign rank of ac 0")
  Member "communication lower bounds using dual polynomials":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "on the degree of boolean functions as polynomials over mathbb z _m")
  Member "disjointness is hard in the multi party number on the forehead model":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "hardness amplification and the approximate degree of constant depth circuits")

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)