human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge groups authors who co-authored the same paper.

Details of the hypergraph:
Center hyperedge (induced by source paper "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.

Includes members:
  Member "Lower bounds for VLSI":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "A characterization of span program size and improved lower bounds for monotone span programs")
  Member "Area—time tradeoffs for matrix multiplication and related problems in VLSI models☆":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "Lower bounds for VLSI")

Question: Please tell me which research area the co-authored paper (i.e., the source paper of the center hyperedge) belongs to. The 4 classes are: Computer science, Mathematics, Engineering, Economics, Psychology, Business. Directly output the class name.

gpt: Computer science