Zobrazeno 1 - 10
of 38
pro vyhledávání: '"Akitoshi Kawamura"'
Publikováno v:
Logical Methods in Computer Science, Vol Volume 10, Issue 1 (2014)
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:
https://doaj.org/article/379d21cdfdb04a1ba14c2faa0db7ccb3
Publikováno v:
Discrete Applied Mathematics. 327:96-100
Autor:
Takeaki Uno, Takashi Horiyama, Ryuhei Uehara, Toshiki Saitoh, Katsuhisa Yamanaka, Akira Suzuki, Yoshio Okamoto, Akitoshi Kawamura, Erik D. Demaine, Shin-ichi Nakano
Publikováno v:
Journal of Graph Algorithms and Applications. 23:3-27
We consider a puzzle consisting of colored tokens on an n-vertex graph, where each token has a distinct starting vertex and a set of allowable target vertices for it to reach, and the only allowed transformation is to “sequentially” move the chos
Autor:
Akitoshi Kawamura, Shuichi Hirahara
Publikováno v:
Computability. 7:45-56
Allender, Friedman, and Gasarch recently proved an upper bound of pspace for the class DTTR K of decidable languages that are polynomial-time truth-table reducible to the set of prefix-free Kolmogorov-random strings regardless of the universal machin
Autor:
Barba, Luis, Cheong, Otfried, Dobbins, Michael Gene, Fleischer, Rudolf, Akitoshi Kawamura, Korman, Matias, Yoshio Okamoto, Pach, János, Yuan Tang, Takeshi Tokuyama, Verdonschot, Sander
Publikováno v:
Journal of Computational Geometry; 2022, Vol. 13 Issue 1, p1-12, 12p
Publikováno v:
Information Processing Letters. 121:6-10
Morpion Solitaire is a pencil-and-paper game for a single player. A move in this game consists of putting a cross at a lattice point and then drawing a line segment that passes through exactly five consecutive crosses. The objective is to make as man
Publikováno v:
Discrete Applied Mathematics. 216:203-210
A unit disk graph is a c -strip graph if it has a unit disk representation in which all centers of the unit disks lie between two parallel lines at distance c . The classes of c -strip graphs for various c are studied in the literature. For example,
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030148119
TAMC
TAMC 2019-15th Annual Conference Theory and Applications of Models of Computation
TAMC 2019-15th Annual Conference Theory and Applications of Models of Computation, Apr 2019, Tokyo, Japan. pp.337-358
TAMC
TAMC 2019-15th Annual Conference Theory and Applications of Models of Computation
TAMC 2019-15th Annual Conference Theory and Applications of Models of Computation, Apr 2019, Tokyo, Japan. pp.337-358
In this work we put forward a complexity class of type-two linear-time. For such a definition to be meaningful, a detailed protocol for the cost of interactions with functional inputs has to be fixed. This includes some design decisions the defined c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::13cbe031622818ea8995621a92196922
https://doi.org/10.1007/978-3-030-14812-6_21
https://doi.org/10.1007/978-3-030-14812-6_21
Publikováno v:
WoLLIC 2018: Logic, Language, Information, and Computation
Wollic 2018-International Workshop on Logic, Language, Information, and Computation
Wollic 2018-International Workshop on Logic, Language, Information, and Computation, Jul 2018, Bogota, Colombia. pp.223-236, ⟨10.1007/978-3-662-57669-4_13⟩
Logic, Language, Information, and Computation ISBN: 9783662576687
WoLLIC
Wollic 2018-International Workshop on Logic, Language, Information, and Computation
Wollic 2018-International Workshop on Logic, Language, Information, and Computation, Jul 2018, Bogota, Colombia. pp.223-236, ⟨10.1007/978-3-662-57669-4_13⟩
Logic, Language, Information, and Computation ISBN: 9783662576687
WoLLIC
Real complexity theory is a resource-bounded refinement of computable analysis and provides a realistic notion of running time of computations over real numbers, sequences, and functions by relying on Turing machines to handle approximations of arbit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::13e040cecc5d0ea283c9b2645328402c
https://inria.hal.science/hal-02019142
https://inria.hal.science/hal-02019142
Autor:
Akitoshi Kawamura, Diego Seco, Robert Fraser, Alejandro López-Ortiz, Reza Dorrigiv, Meng He, Shahin Kamali
Publikováno v:
WAOA
We study optimization problems for the Euclidean Minimum Spanning Tree (MST) problem on imprecise data. To model imprecision, we accept a set of disjoint disks in the plane as input. From each member of the set, one point must be selected, and the MS