A
Akitoshi Kawamura
Researcher at University of Tokyo
Publications - 63
Citations - 713
Akitoshi Kawamura is an academic researcher from University of Tokyo. The author has contributed to research in topics: Computability & Metric space. The author has an hindex of 15, co-authored 61 publications receiving 656 citations. Previous affiliations of Akitoshi Kawamura include Research Institute for Mathematical Sciences & Kyushu University.
Papers
More filters
Journal ArticleDOI
Complexity Theory for Operators in Analysis
TL;DR: An extension of the framework for discussing the computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represented only through approximation is proposed, using a certain class of string functions as names representing these objects.
Journal ArticleDOI
Fence patrolling by mobile agents with distinct speeds
TL;DR: In this paper, it was shown that the maximum length of the line segment of a line segment can be patrolled by a set of mobile agents with given speeds, such that every point on the fence is visited by an agent at least once in every unit time period.
Journal ArticleDOI
Complexity Theory for Operators in Analysis
TL;DR: In this article, an extension of the framework for discussing the computational complexity of problems involving uncountably many objects, such as real numbers, sets and functions, that can be represented only through approximation is proposed.
Journal ArticleDOI
Lipschitz Continuous Ordinary Differential Equations are Polynomial-Space Complete
TL;DR: In answer to Ko’s question raised in 1983, it is shown that an initial value problem given by a polynomial-time computable, Lipschitz continuous function can have a poynomial-space complete solution.
Journal ArticleDOI
On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods
Reza Dorrigiv,Robert Fraser,Meng He,Shahin Kamali,Akitoshi Kawamura,Alejandro López-Ortiz,Diego Seco +6 more
TL;DR: Deterministic and parameterized approximation algorithms for the max-MSTN problem, and a parameterized algorithm for the MSTn problem are provided, and hardness of approximation proofs for both settings are presented.