Pages that link to "Item:Q638525"
From MaRDI portal
The following pages link to An exact algorithm for the Boolean connectivity problem for \(k\)-CNF (Q638525):
Displaying 13 items.
- Approximability of the subset sum reconfiguration problem (Q489711) (← links)
- Linear-time algorithm for sliding tokens on trees (Q496016) (← links)
- The complexity of dominating set reconfiguration (Q517018) (← links)
- On reconfigurability of target sets (Q2110378) (← links)
- Reconfiguration of list \(L(2,1)\)-labelings in a graph (Q2250462) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Reconfiguration of maximum-weight \(b\)-matchings in a graph (Q2420651) (← links)
- Shortest reconfiguration of sliding tokens on subclasses of interval graphs (Q2658043) (← links)
- Computational complexity of jumping block puzzles (Q2695336) (← links)
- Shortest Reconfiguration of Sliding Tokens on a Caterpillar (Q2803826) (← links)
- On the Boolean Connectivity Problem for Horn Relations (Q3612466) (← links)
- Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect (Q5916254) (← links)
- Computational complexity of jumping block puzzles (Q6144017) (← links)