The following pages link to Naoto Ohsaka (Q2032175):
Displaying 5 items.
- A fully polynomial parameterized algorithm for counting the number of reachable vertices in a digraph (Q2032176) (← links)
- Spanning tree constrained determinantal point processes are hard to (approximately) evaluate (Q2060533) (← links)
- On reconfigurability of target sets (Q2110378) (← links)
- On the Power of Tree-Depth for Fully Polynomial FPT Algorithms (Q3304140) (← links)
- Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes (Q5076319) (← links)
