Login / Signup
Non-deterministic Quasi-Polynomial Time is Average-case Hard for ACC Circuits.
Lijie Chen
Published in:
Electron. Colloquium Comput. Complex. (2019)
Keyphrases
</>
average case
worst case
worst case analysis
learning curves
uniform distribution
approximation algorithms
lower bound
greedy algorithm
decomposable negation normal form
average case complexity
deterministic domains
np hard
special case
upper bound
computational complexity
vc dimension
image quality
machine learning