|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 9 occurrences of 8 keywords
|
|
|
|
|
Results
Found 38 publication records. Showing 38 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Kazuyuki Amano, Yuta Kojima, Toshiya Kurabayashi, Keita Kurihara, Masahiro Nakamura, Ayaka Omi, Toshiyuki Tanaka, Koichi Yamazaki |
How to Solve the Torus Puzzle.  |
Algorithms  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuyuki Amano |
On Extremal k-CNF Formulas. |
Electronic Notes in Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuyuki Amano |
Minterm-transitive functions with asymptotically smallest block sensitivity. |
Inf. Process. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuyuki Amano |
On Directional vs. General Randomized Decision Tree Complexity for Read-Once Formulas. |
Chicago J. Theor. Comput. Sci. |
2011 |
DBLP BibTeX RDF |
|
| 1 | Kazuyuki Amano, Jun Tarui |
A well-mixed function with circuit complexity 5n: Tightness of the Lachish-Raz-type bounds. |
Theor. Comput. Sci. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuyuki Amano |
Tight Bounds on the Average Sensitivity of k-CNF. |
Theory of Computing |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuyuki Amano |
Bounding the Randomized Decision Tree Complexity of Read-Once Boolean Functions. |
SODA |
2011 |
DBLP BibTeX RDF |
|
| 1 | Hideaki Fukuhara, Eiji Takimoto, Kazuyuki Amano |
NPN-Representatives of a Set of Optimal Boolean Formulas. |
IEICE Transactions |
2010 |
DBLP BibTeX RDF |
|
| 1 | Kazuyuki Amano |
k-Subgraph Isomorphism on AC0 Circuits. |
Computational Complexity |
2010 |
DBLP BibTeX RDF |
|
| 1 | Kazuyuki Amano |
Researching the Complexity of Boolean Functions with Computers. |
Bulletin of the EATCS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Kazuyuki Amano |
New Upper Bounds on the Average PTF Density of Boolean Functions. |
ISAAC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuyuki Amano |
Bounds on the Size of Small Depth Circuits for Approximating Majority |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Manabu Shimada, Kazuyuki Amano |
A Note on the Middle Levels Conjecture |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Kazuyuki Amano |
Bounds on the Size of Small Depth Circuits for Approximating Majority. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuyuki Amano |
k-Subgraph Isomorphism on AC0 Circuits. |
IEEE Conference on Computational Complexity |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuyuki Amano, Jun Tarui |
A Well-Mixed Function with Circuit Complexity 5n±o(n): Tightness of the Lachish-Raz-Type Bounds. |
TAMC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Takayuki Sato, Kazuyuki Amano, Eiji Takimoto, Akira Maruoka |
Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments. |
COCOON |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuyuki Amano, Akira Maruoka |
Better upper bounds on the QOBDD size of integer multiplication. |
Discrete Applied Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuyuki Amano, Akira Maruoka |
On learning monotone Boolean functions under the uniform distribution. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuyuki Amano, Akira Maruoka |
The Monotone Circuit Complexity of Quadratic Boolean Functions. |
Algorithmica |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Takayuki Sato, Kazuyuki Amano, Akira Maruoka |
On the Negation-Limited Circuit Complexity of Sorting and Inverting k-tonic Sequences. |
COCOON |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuyuki Amano, Akira Maruoka |
On the Complexity of Depth-2 Circuits with Threshold Gates. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuyuki Amano, Akira Maruoka |
Better Simulation of Exponential Threshold Weights by Polynomial Weights |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Kazuyuki Amano, Akira Maruoka |
The Potential of the Approximation Method. |
SIAM J. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuyuki Amano, Akira Maruoka |
On the Monotone Circuit Complexity of Quadratic Boolean Functions. |
ISAAC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuyuki Amano, Kazuo Iwama, Akira Maruoka, Kenshi Matsuo, Akihiro Matsuura |
Inclusion-exclusion for k-CNF formulas. |
Inf. Process. Lett. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuyuki Amano, Akira Maruoka, Jun Tarui |
On the negation-limited circuit complexity of merging. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuyuki Amano, Akira Maruoka |
On Optimal Merging Networks. |
MFCS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuyuki Amano, Akira Maruoka |
Some Properties of MODm Circuits Computing Simple Functions. |
CIAC |
2003 |
DBLP DOI BibTeX RDF |
modular circuits, composite modulus, lower bounds, Fourier analysis, symmetric functions |
| 1 | Kazuyuki Amano, Akira Maruoka |
On Learning Monotone Boolean Functions under the Uniform Distribution. |
ALT |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuyuki Amano, Tsukuru Hirosawa, Yusuke Watanabe, Akira Maruoka |
The Computational Power of a Family of Decision Forests. |
MFCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuyuki Amano, John Tromp, Paul M. B. Vitányi, Osamu Watanabe |
On a Generalized Ruin Problem. |
RANDOM-APPROX |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Jun Mizuno, Tasuya Watanabe, Kazuya Ueki, Kazuyuki Amano, Eiji Takimoto, Akira Maruoka |
On-Line Estimation of Hidden Markov Model Parameters. |
Discovery Science |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuyuki Amano, Akira Maruoka, Jun Tarui |
On the Negation-Limited Circuit Complexity of Merging. |
COCOON |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuyuki Amano, Akira Maruoka |
Approximation Algorithms for DNF Under Distributions with Limited Independence. |
Theory Comput. Syst. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Kazuyuki Amano, Akira Maruoka |
Potential of the Approximation Method (extended abstract). |
FOCS |
1996 |
DBLP DOI BibTeX RDF |
precise versions, bottleneck counting argument, sunflower contraction, lower bounds, Boolean functions, vertices, cliques, approximation method, monotone circuit |
Displaying result #1 - #38 of 38 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")