The following pages link to Kenya Ueno (Q428878):
Displaying 7 items.
- A stronger LP bound for formula size lower bounds via clique constraints (Q428879) (← links)
- Formula Complexity of Ternary Majorities (Q2914347) (← links)
- Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds (Q3586121) (← links)
- Exploring the Limits of Subadditive Approaches: Parallels between Optimization and Complexity Theory (Q5135262) (← links)
- BREAKING THE RECTANGLE BOUND BARRIER AGAINST FORMULA SIZE LOWER BOUNDS (Q5168421) (← links)
- A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints (Q5390018) (← links)
- Algorithms and Computation (Q5897907) (← links)
