IEICE Technical Committee Submission System
Conference Schedule		 Online Proceedings
[Sign in]
Tech. Rep. Archives
    [Japanese] / [English] 
( Committee/Place/Topics  ) --Press->
 
( Paper Keywords:  /  Column:Title Auth. Affi. Abst. Keyword ) --Press->

All Technical Committee Conferences  (Searched in: All Years)

Search Results: Conference Papers
 Conference Papers (Available on Advance Programs)  (Sort by: Date Descending)
 Results 1 - 6 of 6  /   
Committee Date Time Place Paper Title / Authors Abstract Paper #
COMP 2023-03-02
15:15		 Tokyo Ochanomizu University When Input Integers are Given in the Unary Numeral Representation -- (Preliminary Report) --
Tomoyuki Yamakami (U of Fukui) COMP2022-37		 Many NP-complete problems take integers as part of their input instances. These input integers are given in general in t... [more] COMP2022-37
pp.21-27
WBS, IT, ISEC 2021-03-04
11:45		 Online Online Streaming Data Compression and Decompression by One-Way Quantum Finite-State Automata, Leading to Quantum Finite-State Deep and Shallow Information (Preliminary Report)
Tomoyuki Yamakami (U of Fukui) IT2020-117 ISEC2020-47 WBS2020-36		 The logical depth of a piece of data has served as a complexity measure to
describe the amount of “useful” and "non-ran... [more]		 IT2020-117 ISEC2020-47 WBS2020-36
pp.31-36
COMP, IPSJ-AL 2020-09-02
11:30		 Online Online What Restrictions Naturally Allow Well-Known NP-Complete Problems to Yield NL-Completeness and the Linear Space Hypothesis?
Tomoyuki Yamakami (U of Fukui) COMP2020-10		 Many practical combinatorial problems have been shown to be NP-complete or NP-hard. To cope with further real-life situa... [more] COMP2020-10
pp.33-40
COMP 2019-12-13
16:25		 Gunma Ikaho Seminar House, Gunma University Limited Deterministic Automata and Pumping Lemma
Kosei Yoshida, Tomoyuki Yamakami (U of Fukui) COMP2019-41		 This pape, introduced a pumping lemma for languages recognizable by limited deterministic automata. We use this lemma to... [more] COMP2019-41
pp.85-92
QIT
(2nd)		 2018-11-26
09:50		 Tokyo The University of Tokyo Non-Uniform State Complexity of Quantum Finite Automata and Quantum Polynomial-Time Logarithmic-Space Computation with Quantum Advice -- (Preliminary Report) --
Tomoyuki Yamakami (U of Fukui) 		The state complexity of a finite(-state) automaton intuitively measures the size of the description of the automaton. Sa... [more]
AP 2012-01-19
13:40		 Fukuoka Kyushu Inst. of Tech. Design Method of Loop-Slot type AMC with Loss Dielectric Substrate
Yasutaka Murakami, Toshikazu Hori, Mitoshi Fujimoto (Univ. Fukui) AP2011-166		  [more] AP2011-166
pp.115-118
 Results 1 - 6 of 6  /   
Choose a download format for default settings. [NEW !!]
Text format pLaTeX format CSV format BibTeX format
Copyright and reproduction : All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan