Ei Ando

activity

20162026

V

-polytope ---It is Hard to Compute The Volume of The Intersection of Two Cross-polytopes

1 citations · 1 across the 3 of their papers we have counts for

collaborators

3 papers

cs.CC2026

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

Ei Ando

We investigate the problem of computing the distribution function for the shortest and longest path lengths in a directed graph with random edge lengths. Specifically, when these l…

cs.CC2019

The Distribution Function of the Longest Path Length in Constant Treewidth DAGs with Random Edge Length

Ei Ando

This paper is about the length $X_{MAX}$ of the longest path in directed acyclic graph (DAG) $G = (V, E)$ with random edge lengths, where $∣ V ∣ = n$ and $∣ E ∣ = m$ . When the edge length…

cs.CC2016★ 1 cited

An FPTAS for the Volume of a $V$ -polytope ---It is Hard to Compute The Volume of The Intersection of Two Cross-polytopes

Ei Ando, Shuji Kijima

Given an $n$ -dimensional convex body by a membership oracle in general, it is known that any polynomial-time deterministic algorithm cannot approximate its volume within ratio $(n/…

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

The Distribution Function of the Longest Path Length in Constant Treewidth DAGs with Random Edge Length

An FPTAS for the Volume of a V-polytope ---It is Hard to Compute The Volume of The Intersection of Two Cross-polytopes

An FPTAS for the Volume of a $V$ -polytope ---It is Hard to Compute The Volume of The Intersection of Two Cross-polytopes