On the complexity of restarting

DOI10.1007/978-3-030-19955-5_22OpenAlexW2950429804MaRDI QIDQ2330563

Jan-Hendrik Lorenz

Publication date: 22 October 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-19955-5_22

zbMATH Keywords

computational complexityprobability distributioninapproximabilityNPrestarts\(\#\)Pfixed-cutoff strategy

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (2)

Restart strategies in a continuous setting ⋮ Promise Problems on Probability Distributions

This page was built for publication: On the complexity of restarting