|
|
All Technical Committee Conferences (Searched in: All Years)
|
|
Search Results: Conference Papers |
Conference Papers (Available on Advance Programs) (Sort by: Date Descending) |
|
Committee |
Date Time |
Place |
Paper Title / Authors |
Abstract |
Paper # |
COMP |
2019-03-18 17:30 |
Tokyo |
The University of Tokyo |
Lower Bounds and Satisfiability Algorithms for Bounded Width Circuits Hiroki Morizumi (Shimane Univ.) |
[more] |
|
COMP |
2014-12-05 11:00 |
Kumamoto |
Sojo University |
On Zero-Suppressed Binary Decision Diagrams and Complexity Theory Hiroki Morizumi (Shimane Univ.) COMP2014-34 |
Zero-suppressed binary decision diagrams (ZDDs) are a data structure representing Boolean functions, and one of the most... [more] |
COMP2014-34 pp.17-19 |
COMP |
2013-12-20 14:50 |
Okinawa |
Okinawa Industry Support Center |
Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions Hiroki Morizumi (Shimane Univ.) COMP2013-46 |
Sensitivity, block sensitivity, and certificate complexity are complexity measures for Boolean functions. In this note, ... [more] |
COMP2013-46 pp.53-55 |
COMP, IPSJ-AL |
2013-05-18 09:55 |
Hokkaido |
Otaru University of Commerce |
Complexity of Counting Output Patterns of Logic Circuits Kei Uchizawa (Yamagata Univ.), Zhenghong Wang (Tohoku Univ.), Hiroki Morizumi (Shimane Univ.), Xiao Zhou (Tohoku Univ.) COMP2013-14 |
Let $C$ be a logic circuit consisting of $s$ gates
$g_1, g_2, dots , g_s$, then
the output pattern of $C$ for an input... [more] |
COMP2013-14 pp.97-102 |
COMP |
2006-12-04 17:05 |
Aichi |
Nagoya University |
Linear-Size Log-Depth Negation-Limited Inverter for k-tonic 0/1 Sequences Hiroki Morizumi (Kyoto Univ.), Jun Tarui (Univ. of Electro-Comm.) |
A binary sequence $x_1, \ldots, x_n$ is called $k$-tonic if for $1 \leq i \leq n-1$ the number of $i$'s such that $x_i \... [more] |
COMP2006-49 pp.57-60 |
COMP |
2006-06-23 11:10 |
Saitama |
Saitama Univ. |
Reductions for Monotone Boolean Circuits Kazuo Iwama, Hiroki Morizumi (Kyoto Univ.) |
The large class, say {\it NLOG}, of Boolean functions, including 0-1 Sort and 0-1 Merge, have an upper bound of $O(n\log... [more] |
COMP2006-19 pp.15-19 |
|
|
|
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]
|