Feb26

## Barna Saha - Efficient Fine-Grained Algorithms

3108 Etcheverry Hall

- Barna Saha, University of Massachusetts Amherst

- Industrial Engineering & Operations Research

Abstract: One of the greatest successes of computational complexity theory is the classification of countless fundamental computational problems into polynomial-time and NP-hard ones, two classes that are often referred to as tractable and intractable, respectively. However, this crude distinction of algorithmic efficiency is clearly insufficient when handling today's large scale of data. We need...