Average-Case Hardness of NP and PH from Worst-Case Fine-Grained Assumptions.
Lijie ChenShuichi HiraharaNeekon VafaPublished in: ITCS (2022)
Keyphrases
- fine grained
- average case
- worst case
- np hard
- computational complexity
- coarse grained
- np complete
- worst case analysis
- access control
- approximation algorithms
- upper bound
- learning curves
- greedy algorithm
- lower bound
- tightly coupled
- vc dimension
- sample size
- online algorithms
- average case complexity
- special case
- optimal solution
- uniform distribution
- learning algorithm
- co occurrence
- data lineage