8 citations · 23 across the 8 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
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…
cs.CC2012★ 4 cited
Tensor Rank and Strong Quantum Nondeterminism in Multiparty Communication
Marcos Villagra, Masaki Nakanishi, Shigeru Yamashita +1
In this paper we study quantum nondeterminism in multiparty communication. There are three (possibly) different types of nondeterminism in quantum computation: i) strong, ii) weak…