3 citations · 3 across the 1 of their papers we have counts for
2 papers
cs.CC2018
Computational Complexity of Space-Bounded Real Numbers
Masaki Nakanishi, Marcos Villagra
In this work we study the space complexity of computable real numbers represented by fast convergent Cauchy sequences. We show the existence of families of trascendental numbers wh…
quant-ph2006★ 3 cited
Robust Quantum Algorithms with $\eps$-Biased Oracles
Tomoya Suzuki, Shigeru Yamashita, Masaki Nakanishi +1
This paper considers the quantum query complexity of {\it $\eps$-biased oracles} that return the correct value with probability only $1/2 + \eps$. In particular, we show a quantum…