Search the dblp DataBase
Kazuyuki Amano :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Kazuyuki Amano , Akira Maruoka On Learning Monotone Boolean Functions under the Uniform Distribution. [Citation Graph (0, 0)][DBLP ] ALT, 2002, pp:57-68 [Conf ] Kazuyuki Amano , Akira Maruoka Some Properties of MODm Circuits Computing Simple Functions. [Citation Graph (0, 0)][DBLP ] CIAC, 2003, pp:227-237 [Conf ] Kazuyuki Amano , Akira Maruoka , Jun Tarui On the Negation-Limited Circuit Complexity of Merging. [Citation Graph (0, 0)][DBLP ] COCOON, 1999, pp:204-209 [Conf ] Takayuki Sato , Kazuyuki Amano , Akira Maruoka On the Negation-Limited Circuit Complexity of Sorting and Inverting k -tonic Sequences. [Citation Graph (0, 0)][DBLP ] COCOON, 2006, pp:104-115 [Conf ] Jun Mizuno , Tasuya Watanabe , Kazuya Ueki , Kazuyuki Amano , Eiji Takimoto , Akira Maruoka On-Line Estimation of Hidden Markov Model Parameters. [Citation Graph (0, 0)][DBLP ] Discovery Science, 2000, pp:155-169 [Conf ] Kazuyuki Amano , Akira Maruoka Potential of the Approximation Method (extended abstract). [Citation Graph (0, 0)][DBLP ] FOCS, 1996, pp:431-440 [Conf ] Kazuyuki Amano , Akira Maruoka On the Monotone Circuit Complexity of Quadratic Boolean Functions. [Citation Graph (0, 0)][DBLP ] ISAAC, 2004, pp:28-40 [Conf ] Kazuyuki Amano , Tsukuru Hirosawa , Yusuke Watanabe , Akira Maruoka The Computational Power of a Family of Decision Forests. [Citation Graph (0, 0)][DBLP ] MFCS, 2001, pp:123-134 [Conf ] Kazuyuki Amano , Akira Maruoka On Optimal Merging Networks. [Citation Graph (0, 0)][DBLP ] MFCS, 2003, pp:152-161 [Conf ] Kazuyuki Amano , Akira Maruoka On the Complexity of Depth-2 Circuits with Threshold Gates. [Citation Graph (0, 0)][DBLP ] MFCS, 2005, pp:107-118 [Conf ] 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. [Citation Graph (0, 0)][DBLP ] MFCS, 1998, pp:399-408 [Conf ] Kazuyuki Amano , John Tromp , Paul M. B. Vitányi , Osamu Watanabe On a Generalized Ruin Problem. [Citation Graph (0, 0)][DBLP ] RANDOM-APPROX, 2001, pp:181-191 [Conf ] Kazuyuki Amano , Akira Maruoka The Monotone Circuit Complexity of Quadratic Boolean Functions. [Citation Graph (0, 0)][DBLP ] Algorithmica, 2006, v:46, n:1, pp:3-14 [Journal ] Kazuyuki Amano , Akira Maruoka , Jun Tarui On the negation-limited circuit complexity of merging. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2003, v:126, n:1, pp:3-8 [Journal ] Kazuyuki Amano , Akira Maruoka Better upper bounds on the QOBDD size of integer multiplication. [Citation Graph (0, 0)][DBLP ] Discrete Applied Mathematics, 2007, v:155, n:10, pp:1224-1232 [Journal ] Kazuyuki Amano , Akira Maruoka Better Simulation of Exponential Threshold Weights by Polynomial Weights [Citation Graph (0, 0)][DBLP ] Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:090, pp:- [Journal ] Kazuyuki Amano , Kazuo Iwama , Akira Maruoka , Kenshi Matsuo , Akihiro Matsuura Inclusion-exclusion for k-CNF formulas. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 2003, v:87, n:2, pp:111-117 [Journal ] Kazuyuki Amano , Akira Maruoka Approximation Algorithms for DNF Under Distributions with Limited Independence. [Citation Graph (0, 0)][DBLP ] Theory Comput. Syst., 1997, v:30, n:2, pp:181-196 [Journal ] Kazuyuki Amano , Akira Maruoka The Potential of the Approximation Method. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2004, v:33, n:2, pp:433-447 [Journal ] 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. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 2005, v:35, n:1, pp:201-216 [Journal ] Kazuyuki Amano , Akira Maruoka On learning monotone Boolean functions under the uniform distribution. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2006, v:350, n:1, pp:3-12 [Journal ] k-Subgraph Isomorphism on AC0 Circuits. [Citation Graph (, )][DBLP ] Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments. [Citation Graph (, )][DBLP ] Bounds on the Size of Small Depth Circuits for Approximating Majority. [Citation Graph (, )][DBLP ] A Well-Mixed Function with Circuit Complexity 5n±o(n): Tightness of the Lachish-Raz-Type Bounds. [Citation Graph (, )][DBLP ] k -Subgraph Isomorphism on AC0 Circuits. [Citation Graph (, )][DBLP ] Bounds on the Size of Small Depth Circuits for Approximating Majority [Citation Graph (, )][DBLP ] A Note on the Middle Levels Conjecture [Citation Graph (, )][DBLP ] Search in 0.005secs, Finished in 0.281secs