Kazuyuki Amano

Available identifiers

zbMath Open amano.kazuyukiMaRDI QIDQ626675

List of research outcomes

Publication	Date of Publication	Type
Escape from the room	2023-08-10	Paper
https://portal.mardi4nfdi.de/entity/Q5005185	2021-08-04	Paper
https://portal.mardi4nfdi.de/entity/Q5136219	2020-11-25	Paper
On the size of depth-two threshold circuits for the inner product mod 2 function	2020-07-27	Paper
On XOR lemmas for the weight of polynomial threshold functions	2019-12-18	Paper
On the Number of p4-Tilings by an n-Omino	2019-09-09	Paper
How to solve the torus puzzle	2019-03-26	Paper
https://portal.mardi4nfdi.de/entity/Q5365151	2017-09-29	Paper
On XOR Lemma for Polynomial Threshold Weight and Length	2016-04-13	Paper
A Nonuniform Circuit Class with Multilayer of Threshold Gates Having Super Quasi Polynomial Size Lower Bounds Against NEXP	2016-04-08	Paper
Ordered biclique partitions and communication complexity problems	2015-04-28	Paper
On extremal \(k\)-CNF formulas	2014-07-29	Paper
https://portal.mardi4nfdi.de/entity/Q5414592	2014-05-06	Paper
Some improved bounds on communication complexity via new decomposition of cliques	2014-02-18	Paper
https://portal.mardi4nfdi.de/entity/Q2857316	2013-11-01	Paper
Minterm-transitive functions with asymptotically smallest block sensitivity	2013-04-04	Paper
https://portal.mardi4nfdi.de/entity/Q3002829	2011-05-24	Paper
A well-mixed function with circuit complexity \(5n\): tightness of the Lachish-Raz-type bounds	2011-04-05	Paper
\(k\)-subgraph isomorphism on \(\text{AC}^{0}\) circuits	2011-02-18	Paper
New Upper Bounds on the Average PTF Density of Boolean Functions	2010-12-09	Paper
https://portal.mardi4nfdi.de/entity/Q3059187	2010-12-08	Paper
https://portal.mardi4nfdi.de/entity/Q3576651	2010-07-30	Paper
Bounds on the Size of Small Depth Circuits for Approximating Majority	2009-07-14	Paper
Inclusion-exclusion for \(k\)-CNF formulas	2009-04-28	Paper
Monotone DNF Formula That Has a Minimal or Maximal Number of Satisfying Assignments	2008-07-10	Paper
A Well-Mixed Function with Circuit Complexity 5n ±o(n): Tightness of the Lachish-Raz-Type Bounds	2008-05-27	Paper
Mathematical Foundations of Computer Science 2003	2007-12-07	Paper
On the Negation-Limited Circuit Complexity of Sorting and Inverting k-tonic Sequences	2007-09-10	Paper
Better upper bounds on the QOBDD size of integer multiplication	2007-06-26	Paper
Mathematical Foundations of Computer Science 2005	2006-10-20	Paper
The monotone circuit complexity of quadratic Boolean functions	2006-10-16	Paper
On learning monotone Boolean functions under the uniform distribution	2006-03-20	Paper
Algorithms and Computation	2005-12-22	Paper
A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log n Negation Gates	2005-10-28	Paper
The Potential of the Approximation Method	2005-02-21	Paper
https://portal.mardi4nfdi.de/entity/Q4437511	2003-12-02	Paper
https://portal.mardi4nfdi.de/entity/Q4420740	2003-08-18	Paper
On the negation-limited circuit complexity of merging	2003-03-09	Paper
https://portal.mardi4nfdi.de/entity/Q4779140	2002-11-25	Paper
https://portal.mardi4nfdi.de/entity/Q4780793	2002-11-21	Paper
https://portal.mardi4nfdi.de/entity/Q4505387	2000-09-27	Paper
https://portal.mardi4nfdi.de/entity/Q4938666	2000-02-23	Paper
https://portal.mardi4nfdi.de/entity/Q4703440	1999-12-15	Paper
https://portal.mardi4nfdi.de/entity/Q4703861	1999-12-01	Paper
https://portal.mardi4nfdi.de/entity/Q4253367	1999-11-08	Paper
https://portal.mardi4nfdi.de/entity/Q4218113	1999-06-27	Paper
Approximation algorithm for DNF under distributions with limited independence	1997-09-15	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Kazuyuki Amano