Kazuyuki Amano

Publication Activity (10 Years)

Years Active: 1996-2023
Publications (10 Years): 17

Top Topics

Threshold Functions

Prime Implicants

Top Venues

IEICE Trans. Inf. Syst.

Publications

Kazuyuki Amano
Depth-Three Circuits for Inner Product and Majority Functions. ISAAC (2023)
Kazuyuki Amano
Lower Bounds on the PTF Weight of ODD-MAXBIT Function. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106 (9) (2023)
Kento Kimura, Kazuyuki Amano, Shin-Ichi Nakano
Escape from the Room. COCOON (2022)
Kazuyuki Amano
Integer Complexity and Mixed Binary-Ternary Representation. ISAAC (2022)
Kento Kimura, Kazuyuki Amano, Tetsuya Araki
On the Minimum Number of Pieces for Two-Dimensional Anti-Slide Using T-Tetrominoes. IEICE Trans. Inf. Syst. (3) (2021)
Kento Kimura, Atsuki Takahashi, Tetsuya Araki, Kazuyuki Amano
Maximum Number of Steps of Topswops on 18 and 19 Cards. CoRR (2021)
Kazuyuki Amano, Shin-Ichi Nakano
An Approximation Algorithm for the 2-Dispersion Problem. IEICE Trans. Inf. Syst. (3) (2020)
Kazuyuki Amano
On the Size of Depth-Two Threshold Circuits for the Inner Product Mod 2 Function. LATA (2020)
Riona Tadaki, Kazuyuki Amano
Search for developments of a box having multiple ways of folding by SAT solver. CoRR (2020)
Kazuyuki Amano, Yoshinobu Haruyama
On the Number of p4-Tilings by an n-Omino. Int. J. Comput. Geom. Appl. 29 (1) (2019)
Kazuyuki Amano, Shoma Tate
On XOR lemmas for the weight of polynomial threshold functions. Inf. Comput. 269 (2019)
Kazuyuki Amano, Masafumi Yoshida
-Majority. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (9) (2018)
Kazuyuki Amano
Depth Two Majority Circuits for Majority and List Expanders. MFCS (2018)
Kazuyuki Amano, Shin-Ichi Nakano
Away from Rivals. CCCG (2018)
Kazuyuki Amano
Enumeration of Boolean functions of sensitivity three and inheritance of nondegeneracy. ISIT (2017)
Kazuyuki Amano, Yoshinobu Haruyama
On the Number of p4-Tilings by an n-Omino. ISAAC (2017)
Kazuyuki Amano
On XOR Lemma for Polynomial Threshold Weight and Length. LATA (2016)
Kazuyuki Amano, Atsushi Saito
A Nonuniform Circuit Class with Multilayer of Threshold Gates Having Super Quasi Polynomial Size Lower Bounds Against NEXP. LATA (2015)
Kazuyuki Amano, Shin-Ichi Nakano, Koichi Yamazaki
Anti-Slide. J. Inf. Process. 23 (3) (2015)
Kazuyuki Amano, Atsushi Saito
A Satisfiability Algorithm for Some Class of Dense Depth Two Threshold Circuits. IEICE Trans. Inf. Syst. (1) (2015)
Manami Shigeta, Kazuyuki Amano
Ordered biclique partitions and communication complexity problems. Discret. Appl. Math. 184 (2015)
Kazuyuki Amano, Kyaw May Oo, Yota Otachi, Ryuhei Uehara
Secure Sets and Defensive Alliances in Graphs: A Faster Algorithm and Improved Bounds. IEICE Trans. Inf. Syst. (3) (2015)
Kazuyuki Amano
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (6) (2014)
Kazuyuki Amano
Some improved bounds on communication complexity via new decomposition of cliques. Discret. Appl. Math. 166 (2014)
Kazuyuki Amano
k-CNF formulas. Eur. J. Comb. 35 (2014)
Manami Shigeta, Kazuyuki Amano
Ordered Biclique Partitions and Communication Complexity Problems. CoRR (2013)
Kazuyuki Amano, Yuta Kojima, Toshiya Kurabayashi, Keita Kurihara, Masahiro Nakamura, Ayaka Omi, Toshiyuki Tanaka, Koichi Yamazaki
How to Solve the Torus Puzzle. Algorithms 5 (1) (2012)
Kazuyuki Amano
Tight Bounds on the Average Sensitivity of k-CNF. Theory Comput. 7 (1) (2011)
Kazuyuki Amano
Minterm-transitive functions with asymptotically smallest block sensitivity. Inf. Process. Lett. 111 (23-24) (2011)
Kazuyuki Amano
On Directional vs. General Randomized Decision Tree Complexity for Read-Once Formulas. Chic. J. Theor. Comput. Sci. 2011 (2011)
Kazuyuki Amano
Bounding the Randomized Decision Tree Complexity of Read-Once Boolean Functions. SODA (2011)
Kazuyuki Amano, Jun Tarui
A well-mixed function with circuit complexity 5n: Tightness of the Lachish-Raz-type bounds. Theor. Comput. Sci. 412 (18) (2011)
Kazuyuki Amano
On Extremal k-CNF Formulas. Electron. Notes Discret. Math. 38 (2011)
Hideaki Fukuhara, Eiji Takimoto, Kazuyuki Amano
NPN-Representatives of a Set of Optimal Boolean Formulas. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (6) (2010)
Kazuyuki Amano
Researching the Complexity of Boolean Functions with Computers. Bull. EATCS 101 (2010)
Kazuyuki Amano
Circuits. Comput. Complex. 19 (2) (2010)
Kazuyuki Amano
New Upper Bounds on the Average PTF Density of Boolean Functions. ISAAC (1) (2010)
Kazuyuki Amano
On Directional vs. Undirectional Randomized Decision Tree Complexity for Read-Once Formulas. CATS (2010)
Kazuyuki Amano
Bounds on the Size of Small Depth Circuits for Approximating Majority. ICALP (1) (2009)
Manabu Shimada, Kazuyuki Amano
A Note on the Middle Levels Conjecture CoRR (2009)
Kazuyuki Amano
Bounds on the Size of Small Depth Circuits for Approximating Majority CoRR (2009)
Kazuyuki Amano
Circuits. Computational Complexity Conference (2009)
Kazuyuki Amano, Jun Tarui
A Well-Mixed Function with Circuit Complexity 5n±o(n): Tightness of the Lachish-Raz-Type Bounds. TAMC (2008)
Takayuki Sato, Kazuyuki Amano, Eiji Takimoto, Akira Maruoka
Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments. COCOON (2008)
Kazuyuki Amano, Akira Maruoka
Better upper bounds on the QOBDD size of integer multiplication. Discret. Appl. Math. 155 (10) (2007)
Kazuyuki Amano, Akira Maruoka
The Monotone Circuit Complexity of Quadratic Boolean Functions. Algorithmica 46 (1) (2006)
Kazuyuki Amano, Akira Maruoka
On learning monotone Boolean functions under the uniform distribution. Theor. Comput. Sci. 350 (1) (2006)
Takayuki Sato, Kazuyuki Amano, Akira Maruoka
-tonic Sequences. COCOON (2006)
Kazuyuki Amano, Akira Maruoka
On the Complexity of Depth-2 Circuits with Threshold Gates. MFCS (2005)
Kazuyuki Amano, Akira Maruoka
Negation Gates. SIAM J. Comput. 35 (1) (2005)
Kazuyuki Amano, Akira Maruoka
On the Monotone Circuit Complexity of Quadratic Boolean Functions. ISAAC (2004)
Kazuyuki Amano, Akira Maruoka
Better Simulation of Exponential Threshold Weights by Polynomial Weights Electron. Colloquium Comput. Complex. (090) (2004)
Kazuyuki Amano, Akira Maruoka
The Potential of the Approximation Method. SIAM J. Comput. 33 (2) (2004)
Kazuyuki Amano, Akira Maruoka
On Optimal Merging Networks. MFCS (2003)
Kazuyuki Amano, Kazuo Iwama, Akira Maruoka, Kenshi Matsuo, Akihiro Matsuura
Inclusion-exclusion for k-CNF formulas. Inf. Process. Lett. 87 (2) (2003)
Kazuyuki Amano, Akira Maruoka, Jun Tarui
On the negation-limited circuit complexity of merging. Discret. Appl. Math. 126 (1) (2003)
Kazuyuki Amano, Akira Maruoka
Circuits Computing Simple Functions. CIAC (2003)
Kazuyuki Amano, Akira Maruoka
On Learning Monotone Boolean Functions under the Uniform Distribution. ALT (2002)
Kazuyuki Amano, Tsukuru Hirosawa, Yusuke Watanabe, Akira Maruoka
The Computational Power of a Family of Decision Forests. MFCS (2001)
Kazuyuki Amano, John Tromp, Paul M. B. Vitányi, Osamu Watanabe
On a Generalized Ruin Problem. RANDOM-APPROX (2001)
Jun Mizuno, Tasuya Watanabe, Kazuya Ueki, Kazuyuki Amano, Eiji Takimoto, Akira Maruoka
On-Line Estimation of Hidden Markov Model Parameters. Discovery Science (2000)
Kazuyuki Amano, Akira Maruoka, Jun Tarui
On the Negation-Limited Circuit Complexity of Merging. COCOON (1999)
Kazuyuki Amano, Akira Maruoka
Negation Gates. MFCS (1998)
Kazuyuki Amano, Akira Maruoka
Approximation Algorithms for DNF Under Distributions with Limited Independence. Theory Comput. Syst. 30 (2) (1997)
Kazuyuki Amano, Akira Maruoka
Potential of the Approximation Method (extended abstract). FOCS (1996)