Author

Ei Ando

h-index 4 View on Semantic Scholar

We have 1 of 21 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Jul 2026

The Complexity of Computing Path Length Distributions with Edges i.i.d. Random via Local Uniformity

This work establishes that the problem of computing the distribution function for the shortest and longest path lengths in a directed graph with random edge lengths is $\#P-hard, even under the restricted condition that the random edge lengths are identically and independently distributed.

Ei Ando · arXiv.org · 0 citations