Promise Problems On Probability Distributions
COMPLEXITY AND APPROXIMATION: IN MEMORY OF KER-I KO(2020)
摘要
We consider probability distributions which are associated with the running time of probabilistic algorithms, given for algorithmic processing in symbolic form. The considered decision (also counting) problems deal with the question whether a complete restart of the underlying probabilistic algorithm after some number of steps t gives an advantage. Since deciding whether a given symbolic formula indeed represents a probability distribution (either as probability mass function or as cumulative distribution function) is itself a difficult problem to decide, we discuss the issue in terms of promise problems.
更多查看译文
关键词
Promise problems, Probability distributions, Restart strategies
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要