Zobrazeno 1 - 10
of 50
pro vyhledávání: '"Hiroki Morizumi"'
Publikováno v:
Applied Sciences, Vol 13, Iss 14, p 8053 (2023)
Fibers composed of polysaccharides are a promising candidate to be applied for biomaterials such as absorbable surgical sutures, textile fabrics, and hierarchical three-dimensional scaffolds. In this work, in order to fabricate biocompatible fibers w
Externí odkaz:
https://doaj.org/article/69f219ad4bd64123a3d719e6cd0c42d8
Publikováno v:
Applied Sciences; Volume 13; Issue 14; Pages: 8053
Fibers composed of polysaccharides are a promising candidate to be applied for biomaterials such as absorbable surgical sutures, textile fabrics, and hierarchical three-dimensional scaffolds. In this work, in order to fabricate biocompatible fibers w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=multidiscipl::4a8fcada63c994bc9bbca51f5ae62541
Autor:
Hiroki Morizumi
Publikováno v:
Language and Automata Theory and Applications ISBN: 9783030681944
LATA
LATA
Revealing the power of nondeterministic computation and co-nondeterministic computation is one of the central problems in computational complexity. In this paper, we consider the two computation and deterministic computation in Boolean circuits. We g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::cb0f31c07f97fe3a8edcaf540d66cf25
https://doi.org/10.1007/978-3-030-68195-1_9
https://doi.org/10.1007/978-3-030-68195-1_9
Autor:
Hiroki Morizumi
Publikováno v:
IEICE Transactions on Information and Systems. :392-393
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f554e4a9bbee02b67da4ec538aee2295
https://doi.org/10.1587/transinf.2020fcl0004
https://doi.org/10.1587/transinf.2020fcl0004
Autor:
Hiroki Morizumi
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319946665
IWOCA
IWOCA
Zero-suppressed binary decision diagrams (ZDDs) are a data structure representing Boolean functions, and one of the most successful variants of binary decision diagrams (BDDs). On the other hand, BDDs are also called branching programs in computation
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::51d661dded44abd1a09ad3885b88cfd4
https://doi.org/10.1007/978-3-319-94667-2_22
https://doi.org/10.1007/978-3-319-94667-2_22
Autor:
Hiroki Morizumi
Publikováno v:
Information Processing Letters. 111:218-221
Arpe and Manthey [J. Arpe, B. Manthey, Approximability of minimum AND-circuits, Algorithmica 53 (3) (2009) 337-357] recently studied the minimum AND-circuit problem, which is a circuit minimization problem, and showed some results including approxima
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::db8f73e94e2577a00e59239f45b967c1
https://doi.org/10.1016/j.ipl.2010.11.019
https://doi.org/10.1016/j.ipl.2010.11.019
Autor:
Hiroki Morizumi, Genki Suzuki
Publikováno v:
IEICE Transactions on Information and Systems. :257-262
An inverter is a circuit which outputs ¬x1, ¬x2, …, ¬xn for any Boolean inputs x1, x2, …, xn. We consider constructing an inverter with AND gates and OR gates and a few NOT gates. Beals, Nishino and Tanaka have given a construction of an inver
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1711af331a3fe0b0b01d53fb4e0d5ab0
https://doi.org/10.1587/transinf.e93.d.257
https://doi.org/10.1587/transinf.e93.d.257
Autor:
Hiroki Morizumi
Publikováno v:
Theoretical Computer Science. 410(38-40):3988-3994
The minimum number of NOT gates in a Boolean circuit computing a Boolean function f is called the inversion complexity of f. In 1958, Markov determined the inversion complexity of every Boolean function and, in particular, proved that ⌈log2(n+1)⌉
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0f8f67b3e941de49727c8e58175283e9
Autor:
Hiroki Morizumi, Jun Tarui
Publikováno v:
TAMC
In negation-limited complexity, one considers circuits with a limited number of NOT gates, being motivated by the gap in our understanding of monotone versus general circuit complexity. In this context, the study of inverters, i.e., circuits with inp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::22a0da230ef85d588ce0c79e15000d0d
Publikováno v:
Theoretical Computer Science. 408:208-212
The large class, say NLOG, of Boolean functions, including 0-1 Sort and 0-1 Merge, have an upper bound of O(nlogn) for their monotone circuit size, i.e., they have circuits with O(nlogn) AND/OR gates of fan-in two. Suppose that we can use, besides su
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::011f4ad38f29d45462f6786f9a92c0fa
https://doi.org/10.1016/j.tcs.2008.08.009
https://doi.org/10.1016/j.tcs.2008.08.009