Hiroki Morizumi
Tokyo University of Science(JP)
Publications by Year
Research Areas
semigroups and automata theory, Complexity and Algorithms in Graphs, Machine Learning and Algorithms, Formal Methods in Verification, Advanced Graph Theory Research
Most-Cited Works
- → An Explicit Lower Bound of 5n − o(n) for Boolean Circuits(2002)71 cited
- → Limiting negations in non-deterministic circuits(2009)13 cited
- → Limiting Negations in Formulas(2009)12 cited
- → A Note on the Inversion Complexity of Boolean Functions in Boolean Formulas(2008)7 cited
- → Negation-Limited Inverters of Linear Size(2010)6 cited
- → Negation-Limited Complexity of Parity and Inverters(2006)5 cited
- → Linear-size log-depth negation-limited inverter for k-tonic binary sequences(2008)5 cited
- → Fabrication of Polysaccharide-Based Coaxial Fibers Using Wet Spinning Processes and Their Protein Loading Properties(2023)4 cited
- → Sensitivity, Block Sensitivity, and Certificate Complexity of Unate Functions and Read-Once Functions(2014)4 cited
- → Lower Bounds for the Size of Nondeterministic Circuits(2015)3 cited