Zobrazeno 1 - 10
of 94
pro vyhledávání: '"Kawamura, Akitoshi"'
Choosing an encoding over binary strings for input/output to/by a Turing Machine is usually straightforward and/or inessential for discrete data (like graphs), but delicate -- heavily affecting computability and even more computational complexity --
Externí odkaz:
http://arxiv.org/abs/1809.08695
Autor:
Kawamura, Akitoshi, Ziegler, Martin
While concepts and tools from Theoretical Computer Science are regularly applied to, and significantly support, software development for discrete problems, Numerical Engineering largely employs recipes and methods whose correctness and efficiency is
Externí odkaz:
http://arxiv.org/abs/1801.07108
Autor:
Kawamura, Akitoshi, Steinberg, Florian
This paper introduces a more restrictive notion of feasibility of functionals on Baire space than the established one from second-order complexity theory. Thereby making it possible to consider functions on the natural numbers as running times of ora
Externí odkaz:
http://arxiv.org/abs/1704.01405
Autor:
Kawamura, Akitoshi
Computable analysis studies problems involving real numbers, sets and functions from the viewpoint of computability. Elements of uncountable sets (such as real numbers) are represented through approximation and processed by Turing machines. However,
Externí odkaz:
http://hdl.handle.net/1807/29770
Autor:
Barba, Luis, Cheong, Otfried, Dobbins, Michael Gene, Fleischer, Rudolf, Kawamura, Akitoshi, Korman, Matias, Okamoto, Yoshio, Pach, Janos, Tang, Yuan, Tokuyama, Takeshi, Verdonschot, Sander
Given a polygonal region containing a target point (which we assume is the origin), it is not hard to see that there are two points on the perimeter that are antipodal, that is, whose midpoint is the origin. We prove three generalizations of this fac
Externí odkaz:
http://arxiv.org/abs/1511.04123
Autor:
Kawamura, Akitoshi, Soejima, Makoto
Publikováno v:
Theoretical Computer Science 839 (2020) 195-206
Suppose that a set of mobile agents, each with a predefined maximum speed, want to patrol a fence together so as to minimize the longest time interval during which a point on the fence is left unvisited. In 2011, Czyzowicz, G\k{a}sieniec, Kosowski an
Externí odkaz:
http://arxiv.org/abs/1411.6853
Autor:
Kawamura, Akitoshi, Kobayashi, Yusuke
Suppose we want to patrol a fence (line segment) using k mobile agents with given speeds v_1, ..., v_k so that every point on the fence is visited by an agent at least once in every unit time period. Czyzowicz et al. conjectured that the maximum leng
Externí odkaz:
http://arxiv.org/abs/1407.8194
It is proved that the total length of any set of countably many rectifiable curves, whose union meets all straight lines that intersect the unit square U, is at least 2.00002. This is the first improvement on the lower bound of 2 established by Jones
Externí odkaz:
http://arxiv.org/abs/1403.3894
Autor:
Kawamura, Akitoshi, Pauly, Arno
In the context of second-order polynomial-time computability, we prove that there is no general function space construction. We proceed to identify restrictions on the domain or the codomain that do provide a function space with polynomial-time funct
Externí odkaz:
http://arxiv.org/abs/1401.2861
Publikováno v:
Logical Methods in Computer Science, Volume 10, Issue 1 (February 11, 2014) lmcs:960
The computational complexity of the solutions $h$ to the ordinary differential equation $h(0)=0$, $h'(t) = g(t, h(t))$ under various assumptions on the function $g$ has been investigated. Kawamura showed in 2010 that the solution $h$ can be PSPACE-ha
Externí odkaz:
http://arxiv.org/abs/1311.5414