Kazuyuki Amano

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