On the de-randomization of space-bounded approximate counting problems

Dean Doron, Amnon Ta-Shma

Information Processing Letters（2015）

引用 2|浏览33

暂无评分

摘要

•Revisiting the problem of de-randomizing approximate counting.•We study approximation problems in the space-bounded model motivated by quantum algorithms for linear algebraic problems.•Deterministic logspace approximation schemes under de-randomization assumptions.•Randomized logspace approximation schemes under de-quantumization assumptions.

查看译文

关键词

Computational complexity,Approximation algorithms,Randomized algorithms,Space bounded computation,Space bounded quantum computation,Space bounded approximation schemes

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要