77 citations
- Shibuya (Japan)JP7 papers
- The University of TokyoJP5 papers
- Cornell UniversityUS3 papers
- Waseda UniversityJP3 papers
- Yokohama National UniversityJP3 papers
- Nagoya UniversityJP2 papers
- National Institute of InformaticsJP2 papers
- The University of OsakaJP2 papers
- University of Southern CaliforniaUS2 papers
- Yale UniversityUS2 papers
- Anthem (United States)US1 paper
- Bunkyo UniversityJP1 paper
Showing 2021 · cs.DSShow all
2 papers · 2 filters
cs.DS2021★ 3 cited
Some Inapproximability Results of MAP Inference and Exponentiated Determinantal Point Processes
Naoto Ohsaka
We study the computational complexity of two hard problems on determinantal point processes (DPPs). One is maximum a posteriori (MAP) inference, i.e., to find a principal submatrix…
cs.DS2021
On Reconfigurability of Target Sets
Naoto Ohsaka
We study the problem of deciding reconfigurability of target sets of a graph. Given a graph with vertex thresholds , consider a dynamic process in which vertex becomes a…