Average-Case Polynomial-Time Computability of Hamiltonian Dynamics.

Akitoshi Kawamura Holger Thies Martin Ziegler

Published in: MFCS (2018)

Keyphrases

average case
worst case
worst case analysis
learning curves
uniform distribution
approximation algorithms
np hard
upper bound
computational complexity
average case complexity
vc dimension
greedy algorithm
dynamical systems
special case
lower bound
data compression
sample complexity bounds
machine learning