| 2009 |
|---|
| 24 | EE | Kazuyuki Amano:
Bounds on the Size of Small Depth Circuits for Approximating Majority
CoRR abs/0902.0047: (2009) |
| 2008 |
|---|
| 23 | EE | 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 |
| 22 | EE | 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 |
| 2007 |
|---|
| 21 | EE | Kazuyuki Amano,
Akira Maruoka:
Better upper bounds on the QOBDD size of integer multiplication.
Discrete Applied Mathematics 155(10): 1224-1232 (2007) |
| 2006 |
|---|
| 20 | EE | Takayuki Sato,
Kazuyuki Amano,
Akira Maruoka:
On the Negation-Limited Circuit Complexity of Sorting and Inverting k-tonic Sequences.
COCOON 2006: 104-115 |
| 19 | EE | Kazuyuki Amano,
Akira Maruoka:
The Monotone Circuit Complexity of Quadratic Boolean Functions.
Algorithmica 46(1): 3-14 (2006) |
| 18 | EE | Kazuyuki Amano,
Akira Maruoka:
On learning monotone Boolean functions under the uniform distribution.
Theor. Comput. Sci. 350(1): 3-12 (2006) |
| 2005 |
|---|
| 17 | EE | Kazuyuki Amano,
Akira Maruoka:
On the Complexity of Depth-2 Circuits with Threshold Gates.
MFCS 2005: 107-118 |
| 16 | EE | 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) |
| 2004 |
|---|
| 15 | EE | Kazuyuki Amano,
Akira Maruoka:
On the Monotone Circuit Complexity of Quadratic Boolean Functions.
ISAAC 2004: 28-40 |
| 14 | EE | Kazuyuki Amano,
Akira Maruoka:
Better Simulation of Exponential Threshold Weights by Polynomial Weights
Electronic Colloquium on Computational Complexity (ECCC)(090): (2004) |
| 13 | EE | Kazuyuki Amano,
Akira Maruoka:
The Potential of the Approximation Method.
SIAM J. Comput. 33(2): 433-447 (2004) |
| 2003 |
|---|
| 12 | EE | Kazuyuki Amano,
Akira Maruoka:
Some Properties of MODm Circuits Computing Simple Functions.
CIAC 2003: 227-237 |
| 11 | EE | Kazuyuki Amano,
Akira Maruoka:
On Optimal Merging Networks.
MFCS 2003: 152-161 |
| 10 | | Kazuyuki Amano,
Akira Maruoka,
Jun Tarui:
On the negation-limited circuit complexity of merging.
Discrete Applied Mathematics 126(1): 3-8 (2003) |
| 9 | EE | Kazuyuki Amano,
Kazuo Iwama,
Akira Maruoka,
Kenshi Matsuo,
Akihiro Matsuura:
Inclusion-exclusion for k-CNF formulas.
Inf. Process. Lett. 87(2): 111-117 (2003) |
| 2002 |
|---|
| 8 | EE | Kazuyuki Amano,
Akira Maruoka:
On Learning Monotone Boolean Functions under the Uniform Distribution.
ALT 2002: 57-68 |
| 2001 |
|---|
| 7 | EE | Kazuyuki Amano,
Tsukuru Hirosawa,
Yusuke Watanabe,
Akira Maruoka:
The Computational Power of a Family of Decision Forests.
MFCS 2001: 123-134 |
| 6 | EE | Kazuyuki Amano,
John Tromp,
Paul M. B. Vitányi,
Osamu Watanabe:
On a Generalized Ruin Problem.
RANDOM-APPROX 2001: 181-191 |
| 2000 |
|---|
| 5 | EE | 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 |
| 1999 |
|---|
| 4 | EE | Kazuyuki Amano,
Akira Maruoka,
Jun Tarui:
On the Negation-Limited Circuit Complexity of Merging.
COCOON 1999: 204-209 |
| 1998 |
|---|
| 3 | EE | 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 |
| 1997 |
|---|
| 2 | | Kazuyuki Amano,
Akira Maruoka:
Approximation Algorithms for DNF Under Distributions with Limited Independence.
Theory Comput. Syst. 30(2): 181-196 (1997) |
| 1996 |
|---|
| 1 | | Kazuyuki Amano,
Akira Maruoka:
Potential of the Approximation Method (extended abstract).
FOCS 1996: 431-440 |
