| IEICE Technical Committee Submission System Conference Schedule |
Online Proceedings [Sign in] Tech. Rep. Archives |
All Technical Committee Conferences (Searched in: All Years)
| Committee | Date Time | Place | Paper Title / Authors | Abstract | Paper # | |
| COMP, IPSJ-AL | 2024-05-09 10:45 |
Kyoto | Kyoto University (Rakuyu-kaikan) | Depth-Three Circuits for Inner Product and Majority Functions Kazuyuki Amano (Gunma Univ.)  COMP2024-4 |
(To be available after the conference date) [more] | COMP2024-4 p.9 |
| COMP | 2021-12-03 16:00 |
Ishikawa | Kanazawa Chamber of Commerce and Industry (Primary: On-site, Secondary: Online) |
Lower bounds for the total stopping time of 3x+ 1iterates revisited Kazuyuki Amano (Gunma Univ.) COMP2021-29 |
Let $T: mathbb{N} rightarrow mathbb{N}$ be the $3x+1$ function defined by $T(n) = n/2$ if $n$ is even and $T(n) = (3n+1... [more] |
COMP2021-29 pp.40-43 |
| COMP | 2019-12-13 17:25 |
Gunma | Ikaho Seminar House, Gunma University | The Analysis of Anti-slide Kento Kimura, Kazuyuki Amano, Tetsuya Araki (Gunma Univ.) COMP2019-43 |
Let $n$ be a positive integer. Given an $ntimes ntimes n$ box and a number of pieces of some specified shape, we consi... [more] |
COMP2019-43 pp.101-107 |
| COMP | 2019-12-13 17:50 |
Gunma | Ikaho Seminar House, Gunma University | Depth Two Majority Circuits for Majority Yasuhiro Ojima, Takuya Yokokawa, Kazuyuki Amano (Gunma Univ.) COMP2019-44 |
Let $MAJ_n$ denote the Boolean majority function of $n$ input variables. In this paper, we study the construction of de... [more] |
COMP2019-44 pp.109-115 |
| COMP | 2018-10-26 14:30 |
Kyoto | Kyoto University | An Approximation Algorithm for the 2-Dispersion Problem Kazuyuki Amano, Shin-ichi Nakano (Gunma Univ.) COMP2018-26 |
Let $P$ be a set of points on the plane, and $d(p,q)$ be the distance between a pair of points $p,q$ in $P$. For a poi... [more] |
COMP2018-26 pp.41-43 |
| COMP, ISEC | 2016-12-21 14:50 |
Hiroshima | Hiroshima University | ISEC2016-77 COMP2016-38 |
[more] | ISEC2016-77 COMP2016-38 pp.37-42 |
| COMP | 2014-12-05 10:00 |
Kumamoto | Sojo University | A Nonuniform Circuit Class with Multi Layers of Threshold Gates Having Super Quasi Polynomial Size Lower Bounds against NEXP Kazuyuki Amano, Atsushi Saito (Gunma Univ.) COMP2014-32 |
[more] | COMP2014-32 pp.1-8 |
| COMP | 2014-04-24 13:45 |
Miyagi | Tohoku University | A Satisfiability Algorithm for Some Class of Dense Depth Two Threshold Circuits. Kazuyuki Amano, Atsushi Saito (Gunma Univ.) COMP2014-4 |
[more] | COMP2014-4 pp.21-28 |
| COMP | 2009-03-02 09:10 |
Tokyo | Tokyo Institute of Technology | Generating NPN-representatives of a Set of Optimal Boolean Formulas Hideaki Fukuhara (Tohoku Univ.), Eiji Takimoto (Kyushu Univ.), Kazuyuki Amano (Gunma Univ.) COMP2008-54 |
For $k$ variable function $h$ and $k$ functions $g_1, \ldots, g_k$, $f = h \circ (g_1, \ldots, g_k)$denotes a composit... [more] |
COMP2008-54 pp.1-8 |
| COMP | 2008-12-03 13:20 |
Gunma | Gunma Univ. | [Invited Talk]
On the Circuit Complexity of Subgraph Isomorphism Kazuyuki Amano (Gunma Univ.) COMP2008-50 |
[more] | COMP2008-50 p.31 |
| COMP | 2008-03-10 10:20 |
Kanagawa | On the Computational Power of Quantum Circuits with Clifford and π/8 Gates Ken Matsumoto, Kazuyuki Amano (Gunma Univ.) COMP2007-57 |
A set of quantum gates (unitary matrix) is universal if any quantum computation (unitary matrix) is approximated with ... [more] |
COMP2007-57 pp.15-22 |
|
| COMP | 2006-10-17 15:40 |
Miyagi | Tohoku University | On the Computer-Assisted Proof of Linear Lower Bounds on Circuit Size Kazuyuki Amano (Gunma Univ.) |
[more] | COMP2006-39 pp.65-70 |
| COMP | 2005-10-18 11:00 |
Miyagi | Tohoku Univ. | Margin Preserving Projection with Limited Randomness and Embedding to Boolean Space Tatsuya Watanabe, Eiji Takimoto, Kazuyuki Amano, Akira Maruoka (Tohoku Univ.) |
Learning large margin classifiers is one of the most important problems in machine learning. However, it is hard to fin... [more] |
COMP2005-39 pp.21-28 |
| COMP | 2005-10-18 13:15 |
Miyagi | Tohoku Univ. | [Tutorial Lecture]
An approach for obtaining the lower bounds on circuit complexity with mathematical programming Kazuyuki Amano (Tohoku Univ.) |
[more] | |
| COMP | 2005-10-19 11:00 |
Miyagi | Tohoku Univ. | Monotone DNFs that Minimize/Maximize the Number of Satisfying Assignments Kazuyuki Amano (Tohoku Univ.), Takayuki Sato (Sendai Nat. Col. Tech.), Akira Maruoka (Tohoku Univ.) |
[more] | COMP2005-47 pp.19-24 |
| COMP | 2004-12-10 15:00 |
Chiba | Toho University | Better Simulation of Exponential Threshold Weights by Polynomial Weights Kazuyuki Amano, Akira Maruoka (Tohoku Univ.) |
[more] | COMP2004-57 pp.25-29 |
| COMP | 2004-10-14 15:15 |
Miyagi | Tohoku University | On the Monotone Circuit Complexity of Quadratic Boolean Functions Kazuyuki Amano, Akira Maruoka (Tohoku Univ.) |
[more] | COMP2004-40 pp.41-47 |
[Return to Top Page]