Non-deterministic Quasi-Polynomial Time is Average-Case Hard for ACC Circuits.
Lijie ChenPublished in: FOCS (2019)
Keyphrases
- average case
- worst case
- worst case analysis
- learning curves
- approximation algorithms
- uniform distribution
- upper bound
- lower bound
- np hard
- special case
- deterministic domains
- greedy algorithm
- competitive ratio
- decomposable negation normal form
- sample complexity bounds
- dnf formulas
- kernel methods
- euclidean distance
- learning process