Promise Problems on Probability Distributions

DOI10.1007/978-3-030-41672-0_5zbMath1440.68348OpenAlexW3007796112MaRDI QIDQ3297824

Uwe Schoening, Jan-Hendrik Lorenz

Publication date: 20 July 2020

Published in: Complexity and Approximation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-41672-0_5

zbMATH Keywords

probability distributionspromise problemsrestart strategies

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Distribution theory (60E99) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Restart strategies in a continuous setting

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal speedup of Las Vegas algorithms
• Promise problems complete for complexity classes
• On the complexity of restarting
• PP is as Hard as the Polynomial-Time Hierarchy
• The complexity of promise problems with applications to public-key cryptography

This page was built for publication: Promise Problems on Probability Distributions