Kazuyuki Amano

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): 18-29 (2012)

Kazuyuki Amano: On Directional vs. General Randomized Decision Tree Complexity for Read-Once Formulas. Chicago J. Theor. Comput. Sci. 2011 (2011)

Kazuyuki Amano: On Extremal k-CNF Formulas. Electronic Notes in Discrete Mathematics 38: 37-42 (2011)

Kazuyuki Amano: Minterm-transitive functions with asymptotically smallest block sensitivity. Inf. Process. Lett. 111(23-24): 1081-1084 (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): 1646-1651 (2011)

Kazuyuki Amano: Tight Bounds on the Average Sensitivity of k-CNF. Theory of Computing 7(1): 45-48 (2011)

Kazuyuki Amano: Bounding the Randomized Decision Tree Complexity of Read-Once Boolean Functions. SODA 2011: 1729-1744

Kazuyuki Amano: k-Subgraph Isomorphism on AC⁰ Circuits. Computational Complexity 19(2): 183-210 (2010)

Kazuyuki Amano: Researching the Complexity of Boolean Functions with Computers. Bulletin of the EATCS 101: 64-91 (2010)

Hideaki Fukuhara, Eiji Takimoto, Kazuyuki Amano: NPN-Representatives of a Set of Optimal Boolean Formulas. IEICE Transactions 93-A(6): 1008-1015 (2010)

Kazuyuki Amano: On Directional vs. Undirectional Randomized Decision Tree Complexity for Read-Once Formulas. CATS 2010: 25-30

Kazuyuki Amano: New Upper Bounds on the Average PTF Density of Boolean Functions. ISAAC (1) 2010: 304-315

Kazuyuki Amano: k-Subgraph Isomorphism on AC₀ Circuits. IEEE Conference on Computational Complexity 2009: 9-18

Kazuyuki Amano: Bounds on the Size of Small Depth Circuits for Approximating Majority. ICALP (1) 2009: 59-70

Kazuyuki Amano: Bounds on the Size of Small Depth Circuits for Approximating Majority. CoRR abs/0902.0047 (2009)

Manabu Shimada, Kazuyuki Amano: A Note on the Middle Levels Conjecture. CoRR abs/0912.4564 (2009)

Takayuki Sato, Kazuyuki Amano, Eiji Takimoto, Akira Maruoka: Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments. COCOON 2008: 191-203

Kazuyuki Amano, Jun Tarui: A Well-Mixed Function with Circuit Complexity 5n±o(n): Tightness of the Lachish-Raz-Type Bounds. TAMC 2008: 342-350

Kazuyuki Amano, Akira Maruoka: Better upper bounds on the QOBDD size of integer multiplication. Discrete Applied Mathematics 155(10): 1224-1232 (2007)

Kazuyuki Amano, Akira Maruoka: The Monotone Circuit Complexity of Quadratic Boolean Functions. Algorithmica 46(1): 3-14 (2006)

Kazuyuki Amano, Akira Maruoka: On learning monotone Boolean functions under the uniform distribution. Theor. Comput. Sci. 350(1): 3-12 (2006)

Takayuki Sato, Kazuyuki Amano, Akira Maruoka: On the Negation-Limited Circuit Complexity of Sorting and Inverting k-tonic Sequences. COCOON 2006: 104-115

Kazuyuki Amano, Akira Maruoka: A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log n Negation Gates. SIAM J. Comput. 35(1): 201-216 (2005)

Kazuyuki Amano, Akira Maruoka: On the Complexity of Depth-2 Circuits with Threshold Gates. MFCS 2005: 107-118

Kazuyuki Amano, Akira Maruoka: The Potential of the Approximation Method. SIAM J. Comput. 33(2): 433-447 (2004)

Kazuyuki Amano, Akira Maruoka: On the Monotone Circuit Complexity of Quadratic Boolean Functions. ISAAC 2004: 28-40

Kazuyuki Amano, Akira Maruoka: Better Simulation of Exponential Threshold Weights by Polynomial Weights. Electronic Colloquium on Computational Complexity (ECCC)(090) (2004)

Kazuyuki Amano, Akira Maruoka, Jun Tarui: On the negation-limited circuit complexity of merging. Discrete Applied Mathematics 126(1): 3-8 (2003)

Kazuyuki Amano, Kazuo Iwama, Akira Maruoka, Kenshi Matsuo, Akihiro Matsuura: Inclusion-exclusion for k-CNF formulas. Inf. Process. Lett. 87(2): 111-117 (2003)

Kazuyuki Amano, Akira Maruoka: Some Properties of MOD_m Circuits Computing Simple Functions. CIAC 2003: 227-237

Kazuyuki Amano, Akira Maruoka: On Optimal Merging Networks. MFCS 2003: 152-161

Kazuyuki Amano, Akira Maruoka: On Learning Monotone Boolean Functions under the Uniform Distribution. ALT 2002: 57-68

Kazuyuki Amano, Tsukuru Hirosawa, Yusuke Watanabe, Akira Maruoka: The Computational Power of a Family of Decision Forests. MFCS 2001: 123-134

Kazuyuki Amano, John Tromp, Paul M. B. Vitányi, Osamu Watanabe: On a Generalized Ruin Problem. RANDOM-APPROX 2001: 181-191

Jun Mizuno, Tasuya Watanabe, Kazuya Ueki, Kazuyuki Amano, Eiji Takimoto, Akira Maruoka: On-Line Estimation of Hidden Markov Model Parameters. Discovery Science 2000: 155-169

Kazuyuki Amano, Akira Maruoka, Jun Tarui: On the Negation-Limited Circuit Complexity of Merging. COCOON 1999: 204-209

Kazuyuki Amano, Akira Maruoka: A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with At Most (1/6) log log n Negation Gates. MFCS 1998: 399-408

Kazuyuki Amano, Akira Maruoka: Approximation Algorithms for DNF Under Distributions with Limited Independence. Theory Comput. Syst. 30(2): 181-196 (1997)

Kazuyuki Amano, Akira Maruoka: Potential of the Approximation Method (extended abstract). FOCS 1996: 431-440