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: "0 1 integer linear programming with a linear number of constraints"
  Abstract: We give an exact algorithm for the 0-1 Integer Linear Programming problem with a linear number of constraints that improves over exhaustive search by an exponential factor. Specifically, our algorithm runs in time $2^{(1-\text{poly}(1/c))n}$ where n is the number of variables and cn is the number of constraints. The key idea for the algorithm is a reduction to the Vector Domination problem and a new algorithm for that subproblem.

Connected through hyperedge HE-1 (induced by source paper "bridging between 0 1 and linear programming via random walks"):
  with members:
    - "an algorithmic blend of lps and ring equations for promise csps"
    - "which np hard sat and csp problems admit exponentially improved algorithms"
    - "3 sat faster and simpler unique sat bounds for ppsz hold in general"

Connected through hyperedge HE-2 (induced by source paper "continuous time systems for solving 0 1 integer linear programming feasibility problems"):
  with members:
    - "recurrent neural network regularization"
    - "speech recognition with deep recurrent neural networks"
    - "optimization hardness as transient chaos in an analog approach to constraint satisfaction"

Connected through hyperedge HE-3 (induced by source paper "tighter connections between formula sat and shaving logs"):
  with members:
    - "subquadratic algorithms for succinct stable matching"
    - "a dichotomy for regular expression membership testing"
    - "an improved combinatorial algorithm for boolean matrix multiplication"
    - "improved bounds for 3sum k sum and linear degeneracy"
    - "fr echet distance for curves revisited"
    - "subtree isomorphism revisited"
    - "which regular expression patterns are hard to match"
    - "simulating branching programs with edit distance and friends or a polylog shaved is a lower bound made"

Connected through hyperedge HE-4 (induced by source paper "on the fine grained complexity of one dimensional dynamic programming"):
  with members:
    - "fast exact k means k medians and bregman divergence clustering in 1d"
    - "fine grained complexity analysis of two classic tsp variants"
    - "a near linear pseudopolynomial time algorithm for subset sum"
    - "clustered integer 3sum via additive combinatorics"
    - "simulating branching programs with edit distance and friends or a polylog shaved is a lower bound made"
    - "a faster pseudopolynomial time algorithm for subset sum"
    - "quadratic conditional lower bounds for string problems and dynamic time warping"
    - "why walking the dog takes time frechet distance has no strongly subquadratic algorithms unless seth fails"

Connected through hyperedge HE-5 (induced by source paper "faster space efficient algorithms for subset sum k sum and related problems"):
  with members:
    - "fast learning requires good memory a time space lower bound for parity learning"
    - "new algorithms and lower bounds for circuits with linear threshold gates"

Connected through hyperedge HE-6 (induced by source paper "quadratic time hardness of lcs and other sequence similarity measures"):
  with members:
    - "why walking the dog takes time frechet distance has no strongly subquadratic algorithms unless seth fails"
    - "faster all pairs shortest paths via circuit complexity"
    - "fast and compact regular expression matching"

Connected through hyperedge HE-7 (induced by source paper "an improved combinatorial algorithm for boolean matrix multiplication"):
  with members:
    - "powers of tensors and fast matrix multiplication"

Connected through hyperedge HE-8 (induced by source paper "threesomes degenerates and love triangles"):
  with members:
    - "near optimal linear decision trees for k sum and related problems"
    - "connectivity oracles for graphs subject to vertex failures"
    - "subquadratic algorithms for algebraic generalizations of 3sum"
    - "unifying and strengthening hardness for dynamic problems via the online matrix vector multiplication conjecture"
    - "improved bounds for 3sum k sum and linear degeneracy"
    - "clustered integer 3sum via additive combinatorics"
    - "quadratic conditional lower bounds for string problems and dynamic time warping"
    - "why walking the dog takes time frechet distance has no strongly subquadratic algorithms unless seth fails"

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)