77 citations
- Mayu Otani7 · h 18
- Riku Togashi2 profiles7 · h 8
- Naoto Ohsaka6 · h 12
- Kota Yamaguchi2 profiles5 · h 22
- Jun Baba3 profiles3 · h 14
- Ryo Yonetani2 profiles3 · h 2
- Yuta Saito3 profiles3 · h 17
- Alexander Schmeding2 profiles2 · h 12
- Daisuke Moriwaki2 profiles2 · h 6
- E. Simo-Serra2 · h 28
- Kento Uchida2 · h 6
- Kotaro Kikuchi2 · h 10
- Shibuya (Japan)JP5 papers
- The University of TokyoJP4 papers
- Cornell UniversityUS3 papers
- Nagoya UniversityJP2 papers
- National Institute of InformaticsJP2 papers
- The University of OsakaJP2 papers
- Waseda UniversityJP2 papers
- Yokohama National UniversityJP2 papers
- Anthem (United States)US1 paper
- Carnegie Mellon UniversityUS1 paper
- Computing CenterRU1 paper
- Hokkaido UniversityJP1 paper
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2024★ 2 cited
Optimal PSPACE-hardness of Approximating Set Cover Reconfiguration
Shuichi Hirahara, Naoto Ohsaka
In the Minmax Set Cover Reconfiguration problem, given a set system over a universe and its two covers and of…
cs.CC2024★ 2 cited
Alphabet Reduction for Reconfiguration Problems
Naoto Ohsaka
We present a reconfiguration analogue of alphabet reduction à la Dinur (J. ACM, 2007) and its applications. Given a binary constraint graph and its two satisfying assignments $…
cs.CC2023★ 3 cited
Probabilistically Checkable Reconfiguration Proofs and Inapproximability of Reconfiguration Problems
Shuichi Hirahara, Naoto Ohsaka
Motivated by the inapproximability of reconfiguration problems, we present a new PCP-type characterization of PSPACE, which we call a probabilistically checkable reconfiguration pr…