default search action
Kazuyuki Amano
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j30]Kazuyuki Amano:
Lower Bounds on the PTF Weight of ODD-MAXBIT Function. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 106(9): 1189-1190 (2023) - [c29]Kazuyuki Amano:
Depth-Three Circuits for Inner Product and Majority Functions. ISAAC 2023: 7:1-7:16 - 2022
- [c28]Kento Kimura, Kazuyuki Amano, Shin-Ichi Nakano:
Escape from the Room. COCOON 2022: 232-241 - [c27]Kazuyuki Amano:
Integer Complexity and Mixed Binary-Ternary Representation. ISAAC 2022: 29:1-29:16 - 2021
- [j29]Kento Kimura, Kazuyuki Amano, Tetsuya Araki:
On the Minimum Number of Pieces for Two-Dimensional Anti-Slide Using T-Tetrominoes. IEICE Trans. Inf. Syst. 104-D(3): 355-361 (2021) - [i6]Kento Kimura, Atsuki Takahashi, Tetsuya Araki, Kazuyuki Amano:
Maximum Number of Steps of Topswops on 18 and 19 Cards. CoRR abs/2103.08346 (2021) - 2020
- [j28]Kazuyuki Amano, Shin-Ichi Nakano:
An Approximation Algorithm for the 2-Dispersion Problem. IEICE Trans. Inf. Syst. 103-D(3): 506-508 (2020) - [c26]Kazuyuki Amano
:
On the Size of Depth-Two Threshold Circuits for the Inner Product Mod 2 Function. LATA 2020: 235-247 - [i5]Riona Tadaki, Kazuyuki Amano:
Search for developments of a box having multiple ways of folding by SAT solver. CoRR abs/2005.02645 (2020)
2010 – 2019
- 2019
- [j27]Kazuyuki Amano, Shoma Tate:
On XOR lemmas for the weight of polynomial threshold functions. Inf. Comput. 269 (2019) - [j26]Kazuyuki Amano
On the Number of p4-Tilings by an n-Omino. Int. J. Comput. Geom. Appl. 29(1): 3-19 (2019) - 2018
- [j25]Kazuyuki Amano, Masafumi Yoshida:
Depth Two (n-2)-Majority Circuits for n-Majority. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(9): 1543-1545 (2018) - [c25]Kazuyuki Amano, Shin-Ichi Nakano:
Away from Rivals. CCCG 2018: 68-71 - [c24]Kazuyuki Amano:
Depth Two Majority Circuits for Majority and List Expanders. MFCS 2018: 81:1-81:13 - 2017
- [c23]Kazuyuki Amano, Yoshinobu Haruyama:
On the Number of p4-Tilings by an n-Omino. ISAAC 2017: 5:1-5:12 - [c22]Kazuyuki Amano:
Enumeration of Boolean functions of sensitivity three and inheritance of nondegeneracy. ISIT 2017: 251-255 - 2016
- [c21]Kazuyuki Amano:
On XOR Lemma for Polynomial Threshold Weight and Length. LATA 2016: 259-269 - 2015
- [j24]Manami Shigeta, Kazuyuki Amano:
Ordered biclique partitions and communication complexity problems. Discret. Appl. Math. 184: 248-252 (2015) - [j23]Kazuyuki Amano, Atsushi Saito:
A Satisfiability Algorithm for Some Class of Dense Depth Two Threshold Circuits. IEICE Trans. Inf. Syst. 98-D(1): 108-118 (2015) - [j22]Kazuyuki Amano, Kyaw May Oo, Yota Otachi
Secure Sets and Defensive Alliances in Graphs: A Faster Algorithm and Improved Bounds. IEICE Trans. Inf. Syst. 98-D(3): 486-489 (2015) - [j21]Kazuyuki Amano, Shin-Ichi Nakano, Koichi Yamazaki
Anti-Slide. J. Inf. Process. 23(3): 252-257 (2015) - [c20]Kazuyuki Amano, Atsushi Saito:
A Nonuniform Circuit Class with Multilayer of Threshold Gates Having Super Quasi Polynomial Size Lower Bounds Against NEXP. LATA 2015: 461-472 - 2014
- [j20]Kazuyuki Amano:
Some improved bounds on communication complexity via new decomposition of cliques. Discret. Appl. Math. 166: 249-254 (2014) - [j19]Kazuyuki Amano:
On extremal kk-CNF formulas. Eur. J. Comb. 35: 39-50 (2014) - [j18]Kazuyuki Amano:
Foreword. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 97-A(6): 1162 (2014) - 2013
- [i4]Manami Shigeta, Kazuyuki Amano:
Ordered Biclique Partitions and Communication Complexity Problems. CoRR abs/1311.6192 (2013) - 2012
- [j17]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) - 2011
- [j16]Kazuyuki Amano:
On Directional vs. General Randomized Decision Tree Complexity for Read-Once Formulas. Chic. J. Theor. Comput. Sci. 2011 (2011) - [j15]Kazuyuki Amano:
On Extremal k-CNF Formulas. Electron. Notes Discret. Math. 38: 37-42 (2011) - [j14]Kazuyuki Amano:
Minterm-transitive functions with asymptotically smallest block sensitivity. Inf. Process. Lett. 111(23-24): 1081-1084 (2011) - [j13]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) - [j12]Kazuyuki Amano:
Tight Bounds on the Average Sensitivity of k-CNF. Theory Comput. 7(1): 45-48 (2011) - [c19]Kazuyuki Amano:
Bounding the Randomized Decision Tree Complexity of Read-Once Boolean Functions. SODA 2011: 1729-1744 - 2010
- [j11]Kazuyuki Amano:
k-Subgraph Isomorphism on AC0 Circuits. Comput. Complex. 19(2): 183-210 (2010) - [j10]Kazuyuki Amano:
Researching the Complexity of Boolean Functions with Computers. Bull. EATCS 101: 64-91 (2010) - [j9]Hideaki Fukuhara, Eiji Takimoto, Kazuyuki Amano:
NPN-Representatives of a Set of Optimal Boolean Formulas. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 93-A(6): 1008-1015 (2010) - [c18]Kazuyuki Amano:
On Directional vs. Undirectional Randomized Decision Tree Complexity for Read-Once Formulas. CATS 2010: 25-30 - [c17]Kazuyuki Amano:
New Upper Bounds on the Average PTF Density of Boolean Functions. ISAAC (1) 2010: 304-315
2000 – 2009
- 2009
- [c16]Kazuyuki Amano:
k-Subgraph Isomorphism on AC0 Circuits. CCC 2009: 9-18 - [c15]Kazuyuki Amano:
Bounds on the Size of Small Depth Circuits for Approximating Majority. ICALP (1) 2009: 59-70 - [i3]Kazuyuki Amano:
Bounds on the Size of Small Depth Circuits for Approximating Majority. CoRR abs/0902.0047 (2009) - [i2]Manabu Shimada, Kazuyuki Amano:
A Note on the Middle Levels Conjecture. CoRR abs/0912.4564 (2009) - 2008
- [c14]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 - [c13]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
- [j8]Kazuyuki Amano, Akira Maruoka:
Better upper bounds on the QOBDD size of integer multiplication. Discret. Appl. Math. 155(10): 1224-1232 (2007) - 2006
- [j7]Kazuyuki Amano, Akira Maruoka:
The Monotone Circuit Complexity of Quadratic Boolean Functions. Algorithmica 46(1): 3-14 (2006) - [j6]Kazuyuki Amano, Akira Maruoka:
On learning monotone Boolean functions under the uniform distribution. Theor. Comput. Sci. 350(1): 3-12 (2006) - [c12]Takayuki Sato, Kazuyuki Amano, Akira Maruoka:
On the Negation-Limited Circuit Complexity of Sorting and Inverting k-tonic Sequences. COCOON 2006: 104-115 - 2005
- [j5]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) - [c11]Kazuyuki Amano, Akira Maruoka:
On the Complexity of Depth-2 Circuits with Threshold Gates. MFCS 2005: 107-118 - 2004
- [j4]Kazuyuki Amano, Akira Maruoka:
The Potential of the Approximation Method. SIAM J. Comput. 33(2): 433-447 (2004) - [c10]Kazuyuki Amano, Akira Maruoka:
On the Monotone Circuit Complexity of Quadratic Boolean Functions. ISAAC 2004: 28-40 - [i1]Kazuyuki Amano, Akira Maruoka:
Better Simulation of Exponential Threshold Weights by Polynomial Weights. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j3]Kazuyuki Amano, Akira Maruoka, Jun Tarui:
On the negation-limited circuit complexity of merging. Discret. Appl. Math. 126(1): 3-8 (2003) - [j2]Kazuyuki Amano, Kazuo Iwama, Akira Maruoka, Kenshi Matsuo, Akihiro Matsuura:
Inclusion-exclusion for k-CNF formulas. Inf. Process. Lett. 87(2): 111-117 (2003) - [c9]Kazuyuki Amano, Akira Maruoka:
Some Properties of MODm Circuits Computing Simple Functions. CIAC 2003: 227-237 - [c8]Kazuyuki Amano, Akira Maruoka:
On Optimal Merging Networks. MFCS 2003: 152-161 - 2002
- [c7]Kazuyuki Amano, Akira Maruoka:
On Learning Monotone Boolean Functions under the Uniform Distribution. ALT 2002: 57-68 - 2001
- [c6]Kazuyuki Amano, Tsukuru Hirosawa, Yusuke Watanabe, Akira Maruoka:
The Computational Power of a Family of Decision Forests. MFCS 2001: 123-134 - [c5]Kazuyuki Amano, John Tromp, Paul M. B. Vitányi, Osamu Watanabe:
On a Generalized Ruin Problem. RANDOM-APPROX 2001: 181-191 - 2000
- [c4]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
1990 – 1999
- 1999
- [c3]Kazuyuki Amano, Akira Maruoka, Jun Tarui:
On the Negation-Limited Circuit Complexity of Merging. COCOON 1999: 204-209 - 1998
- [c2]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
- [j1]Kazuyuki Amano, Akira Maruoka:
Approximation Algorithms for DNF Under Distributions with Limited Independence. Theory Comput. Syst. 30(2): 181-196 (1997) - 1996
- [c1]Kazuyuki Amano, Akira Maruoka:
Potential of the Approximation Method (extended abstract). FOCS 1996: 431-440
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:49 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: