12 citations · 29 across the 13 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2016★ 1 cited
An FPTAS for the Volume of a -polytope ---It is Hard to Compute The Volume of The Intersection of Two Cross-polytopes
Ei Ando, Shuji Kijima
Given an -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/…
cs.CC2015
The Parity Hamiltonian Cycle Problem
Hiroshi Nishiyama, Yusuke Kobayashi, Yukiko Yamauchi +2
Motivated by a relaxed notion of the celebrated Hamiltonian cycle, this paper investigates its variant, parity Hamiltonian cycle (PHC): A PHC of a graph is a closed walk which visi…