Pages that link to "Item:Q3448854"
From MaRDI portal
The following pages link to Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (Q3448854):
Displayed 16 items.
- The complexity of dominating set reconfiguration (Q517018) (← links)
- On the parameterized complexity of reconfiguration problems (Q527426) (← links)
- On the parameterized complexity of reconfiguration of connected dominating sets (Q832526) (← links)
- Reconfiguration on nowhere dense graph classes (Q1658772) (← links)
- On girth and the parameterized complexity of token sliding and Token Jumping (Q1979464) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- Rerouting shortest paths in planar graphs (Q2403796) (← links)
- The connectivity of Boolean satisfiability: dichotomies for formulas and circuits (Q2411031) (← links)
- Shortest reconfiguration of sliding tokens on subclasses of interval graphs (Q2658043) (← links)
- Shortest Reconfiguration of Sliding Tokens on a Caterpillar (Q2803826) (← links)
- Reconfiguration of Steiner Trees in an Unweighted Graph (Q2819500) (← links)
- Ground State Connectivity of Local Hamiltonians (Q3448820) (← links)
- Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (Q5361235) (← links)
- Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect (Q5916254) (← links)
- (Q6087216) (← links)
- (Q6089671) (← links)
