( en | de | ru )

 

Disambiguation of "Amano, Kazuyuki"

Author of the publication

copydeleteadd this publication to your clipboard
k-Subgraph Isomorphism on AC0 Circuits.

. Comput. Complex., 19 (2): 183-210 (2010)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Kyoko Amano

Yu Amano

Shun'ichi Amano

 

Other publications of authors with the same name

Tight Bounds on the Average Sensitivity of k-CNF.. Theory of Computing, 7 (1): 45-48 (2011)On the Monotone Circuit Complexity of Quadratic Boolean Functions., and . ISAAC, volume 3341 of Lecture Notes in Computer Science, page 28-40. Springer, (2004)Bounds on the Size of Small Depth Circuits for Approximating Majority.. ICALP (1), volume 5555 of Lecture Notes in Computer Science, page 59-70. Springer, (2009)On-Line Estimation of Hidden Markov Model Parameters., , , , , and . Discovery Science, volume 1967 of Lecture Notes in Computer Science, page 155-169. Springer, (2000)An Approximation Algorithm for the 2-Dispersion Problem., and . IEICE Trans. Inf. Syst., 103-D (3): 506-508 (2020)Secure Sets and Defensive Alliances in Graphs: A Faster Algorithm and Improved Bounds., , , and . IEICE Trans. Inf. Syst., 98-D (3): 486-489 (2015)A well-mixed function with circuit complexity 5n: Tightness of the Lachish-Raz-type bounds., and . Theor. Comput. Sci., 412 (18): 1646-1651 (2011)On Extremal k-CNF Formulas.. Electron. Notes Discret. Math., (2011)On XOR lemmas for the weight of polynomial threshold functions., and . Inf. Comput., (2019)On the Number of p4-Tilings by an n-Omino., and . ISAAC, volume 92 of LIPIcs, page 5:1-5:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)