Get started
Author

Kenya Ueno

Observed names: KENYA UENO, Kenya UENO, UENO, Kenya, Ueno, Kenya
Institution: Kyoto University
ORCID: 0000-0002-5623-6595
Observed ORCID: 0000-0002-5623-6595
OpenAlex ID: A5044704304
A stronger LP bound for formula size lower bounds via clique constraints
2012 · Kenya Ueno · Theoretical Computer Science · 4
PDF
Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds
2010 · Kenya Ueno · Lecture notes in computer science · 3
Formula Complexity of Ternary Majorities
2012 · Kenya Ueno · Lecture notes in computer science · 2
Recursion Theoretic Operators for Function Complexity Classes
2005 · Kenya Ueno · Lecture notes in computer science · 2
Effects of Bisphenol A and Retinoic Acid Exposure on Neuron and Brain Formation: A Study in Human Induced Pluripotent Stem Cells and Zebrafish Embryos
2025 · Tomomi Nishie, Tomoki Taya, et al. · Environmental Health Perspectives · 1
PDF
Breaking the Rectangle Bound Barrier Against Formula Size Lower Bounds
2013 · KENYA UENO · International Journal of Foundations of Computer Science · 1
Exploring the Limits of Subadditive Approaches : Parallels between Optimization and Complexity Theory (Special issue: Reviews and lectures : exploring the limits of computation II)
2015 · UENO, Kenya · Institutional Repositories DataBase (IRDB)
Candidate Boolean Functions towards Super-Quadratic Formula Size
2015 · Kenya UENO · IEICE Transactions on Information and Systems
PDF
Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory
2015 · Kenya UENO · Interdisciplinary Information Sciences
PDF
Exact Algorithms for 0-1 Integer Programs with Linear Equality Constraints (コンピュテーション)
2014 · Kenya Ueno · 電子情報通信学会技術研究報告. COMP, コンピュテーション
Exact Algorithms for 0-1 Integer Programs with Linear Equality Constraints
2014 · Ueno, Kenya · arXiv (Cornell University)
PDF
Linear programing and the limitations of computation
2013 · Kenya Ueno · 電子情報通信学会誌
Introduction to Computational Complexity Theory (3): Mathematical Programming Approaches to the Limitations of Computation
2013 · Kenya Ueno · IEICE Technical Report; IEICE Tech. Rep.
Formula Decomposition into Ternary Majorities (New Trends in Algorithms and Theory of Computation)
2012 · Kenya Ueno · Kyoto University Research Information Repository (Kyoto University)
PDF
A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints
2009 · Ueno, Kenya · arXiv (Cornell University)
PDF
A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints
2009 · Ueno, Kenya · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
PDF
Improved Formula Size Lower Bounds for Monotone Self-Dual Boolean Functions
2008 · Kenya Ueno · IEICE technical report. Speech
Reducing L versus P to Reversal versus Access
2006 · Kenya Ueno · IEICE Technical Report; IEICE Tech. Rep.
On time and space complexity of functions
2005 · Kenya Ueno · IEICE Technical Report; IEICE Tech. Rep.
Works count: 19
Citation count: 13
H-index: 2
I10-index:
Year
Topic
Type