Kazuyuki Amano

According to our database1, Kazuyuki Amano authored at least 52 papers between 1996 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
An Approximation Algorithm for the 2-Dispersion Problem.
IEICE Trans. Inf. Syst., 2020

Search for developments of a box having multiple ways of folding by SAT solver.
CoRR, 2020

On the Size of Depth-Two Threshold Circuits for the Inner Product Mod 2 Function.
Proceedings of the Language and Automata Theory and Applications, 2020

2019
On the Number of p4-Tilings by an n-Omino.
Int. J. Comput. Geom. Appl., 2019

On XOR lemmas for the weight of polynomial threshold functions.
Inf. Comput., 2019

2018
Depth Two (<i>n</i>-2)-Majority Circuits for <i>n</i>-Majority.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

Depth Two Majority Circuits for Majority and List Expanders.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Away from Rivals.
Proceedings of the 30th Canadian Conference on Computational Geometry, 2018

2017
Enumeration of Boolean functions of sensitivity three and inheritance of nondegeneracy.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
On XOR Lemma for Polynomial Threshold Weight and Length.
Proceedings of the Language and Automata Theory and Applications, 2016

2015
Anti-Slide.
J. Inf. Process., 2015

A Satisfiability Algorithm for Some Class of Dense Depth Two Threshold Circuits.
IEICE Trans. Inf. Syst., 2015

Secure Sets and Defensive Alliances in Graphs: A Faster Algorithm and Improved Bounds.
IEICE Trans. Inf. Syst., 2015

Ordered biclique partitions and communication complexity problems.
Discret. Appl. Math., 2015

A Nonuniform Circuit Class with Multilayer of Threshold Gates Having Super Quasi Polynomial Size Lower Bounds Against NEXP.
Proceedings of the Language and Automata Theory and Applications, 2015

2014
Foreword.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014

On extremal <i>k</i>k-CNF formulas.
Eur. J. Comb., 2014

Some improved bounds on communication complexity via new decomposition of cliques.
Discret. Appl. Math., 2014

2012
How to Solve the Torus Puzzle.
Algorithms, 2012

2011
Tight Bounds on the Average Sensitivity of k-CNF.
Theory Comput., 2011

A well-mixed function with circuit complexity 5n: Tightness of the Lachish-Raz-type bounds.
Theor. Comput. Sci., 2011

Minterm-transitive functions with asymptotically smallest block sensitivity.
Inf. Process. Lett., 2011

On Extremal k-CNF Formulas.
Electron. Notes Discret. Math., 2011

On Directional vs. General Randomized Decision Tree Complexity for Read-Once Formulas.
Chic. J. Theor. Comput. Sci., 2011

Bounding the Randomized Decision Tree Complexity of Read-Once Boolean Functions.
Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

2010
NPN-Representatives of a Set of Optimal Boolean Formulas.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010

Researching the Complexity of Boolean Functions with Computers.
Bull. EATCS, 2010

<i>k</i>-Subgraph Isomorphism on AC<sup>0</sup> Circuits.
Comput. Complex., 2010

New Upper Bounds on the Average PTF Density of Boolean Functions.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

On Directional vs. Undirectional Randomized Decision Tree Complexity for Read-Once Formulas.
Proceedings of the Theory of Computing 2010, 2010

2009
A Note on the Middle Levels Conjecture
CoRR, 2009

Bounds on the Size of Small Depth Circuits for Approximating Majority.
Proceedings of the Automata, Languages and Programming, 36th International Colloquium, 2009

k-Subgraph Isomorphism on AC<sub>0</sub> Circuits.
Proceedings of the 24th Annual IEEE Conference on Computational Complexity, 2009

2008
A Well-Mixed Function with Circuit Complexity 5n±o(n): Tightness of the Lachish-Raz-Type Bounds.
Proceedings of the Theory and Applications of Models of Computation, 2008

Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007
Better upper bounds on the QOBDD size of integer multiplication.
Discret. Appl. Math., 2007

2006
On learning monotone Boolean functions under the uniform distribution.
Theor. Comput. Sci., 2006

The Monotone Circuit Complexity of Quadratic Boolean Functions.
Algorithmica, 2006

On the Negation-Limited Circuit Complexity of Sorting and Inverting <i>k</i>-tonic Sequences.
Proceedings of the Computing and Combinatorics, 12th Annual International Conference, 2006

2005
A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log <i>n</i> Negation Gates.
SIAM J. Comput., 2005

On the Complexity of Depth-2 Circuits with Threshold Gates.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2004
The Potential of the Approximation Method.
SIAM J. Comput., 2004

Better Simulation of Exponential Threshold Weights by Polynomial Weights
Electron. Colloquium Comput. Complex., 2004

2003
Inclusion-exclusion for k-CNF formulas.
Inf. Process. Lett., 2003

On the negation-limited circuit complexity of merging.
Discret. Appl. Math., 2003

On Optimal Merging Networks.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Some Properties of MOD<sub>m</sub> Circuits Computing Simple Functions.
Proceedings of the Algorithms and Complexity, 5th Italian Conference, 2003

2001
On a Generalized Ruin Problem.
Proceedings of the Approximation, 2001

The Computational Power of a Family of Decision Forests.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

2000
On-Line Estimation of Hidden Markov Model Parameters.
Proceedings of the Discovery Science, 2000

1997
Approximation Algorithms for DNF Under Distributions with Limited Independence.
Theory Comput. Syst., 1997

1996
Potential of the Approximation Method (extended abstract).
Proceedings of the 37th Annual Symposium on Foundations of Computer Science, 1996


  Loading...