TAKIMOTO Eiji | Department of Informatics, Kyushu University
スポンサーリンク
概要
関連著者
-
FUKUHARA Hideaki
Graduate School of Information Sciences, Tohoku University
-
TAKIMOTO Eiji
Department of Informatics, Kyushu University
-
AMANO Kazuyuki
Department of Computer Science, Gunma University
-
Fukuhara Hideaki
Graduate School Of Information Sciences Tohoku University
-
Amano Kazuyuki
Department Of Computer Science Gunma University
-
Takimoto Eiji
Kyushu Univ. Fukuoka‐shi Jpn
-
Takimoto Eiji
Department Of Informatics Kyushu University
-
Fukuhara Hideaki
Tohoku Univ. Sendai‐shi Jpn
-
Takimoto Eiji
Graduate School Of Information Sciences Tohoku University
著作論文
- NPN-Representatives of a Set of Optimal Boolean Formulas
- Lower Bounds on Quantum Query Complexity for Read-Once Formulas with XOR and MUX Operators
- Lower Bounds on Quantum Query Complexity for Read-Once Formulas with XOR and MUX Operators
- NPN-Representatives of a Set of Optimal Boolean Formulas
- DS-1-2 On Formula Size Lower Bounds for Synthesis of Boolean Functions over Disjoint Sets of Variables