human: Given a node-centered hypergraph: <hypergraph>, where nodes represent authors and hyperedges represent groups of authors who co-authored the same paper.

Details of the hypergraph:
Center node: "The Area-Time Complexity of Binary Multiplication"
  Abstract: The problem of performing multtphcaUon of n-bit binary numbers on a chip is considered Let A denote the ch~p area and T the time reqmred to perform mult~phcation. By using a model of computation which is a realistic approx~mauon to current and anucipated LSI or VLSI technology, ~t is shown that A T 2.

Connected through hyperedge HE-1 (induced by source paper "Lower bounds for VLSI"):
  with members:
    - "A characterization of span program size and improved lower bounds for monotone span programs"
    - "Area—time tradeoffs for matrix multiplication and related problems in VLSI models☆"

Connected through hyperedge HE-2 (induced by source paper "Area—time tradeoffs for matrix multiplication and related problems in VLSI models☆"):
  with members:
    - "Lower bounds for VLSI"

Question: Please tell me which research area the center author belongs to. The 4 classes are: Computer science, Mathematics, Engineering, Economics, Psychology, Business. Directly output the class name.

gpt: Computer science