1 citations · 1 across the 6 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2026
The Complexity of Boolean Connectivity Problem of -Horn Formulas
Takashi Horiyama, Shoon Mineyoshi, Yuto Okura +2
The Boolean connectivity problem asks whether the set of satisfying assignments of a given Boolean formula forms a connected subgraph in the -dimensional hypercube. This problem…
cs.CC2026
Hardness of Forcing Unique Perfect Matchings in Bipartite Graphs of Maximum Degree 3
Ryoma Aoshima, Takashi Horiyama, Atsuki Nagao +4
In a graph , a set of edges is called a \emph{forcing set} if there exists a unique perfect matching such that . Similarly, a set of edges is called a…