Professor Goldberg's main research interest is computational complexity, where the aim is to discover which computational problems are feasible, which are inherently infeasible, and why.
She is particularly interested in dichotomies arising in computational counting. Computational counting problems involve the computation of weighted sums. They arise in practical applications from diverse fields including statistics, statistical physics, information theory, coding, and machine learning.
- Computational complexity
- Computational counting