Pages that link to "Item:Q5902502"
From MaRDI portal
The following pages link to The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies (Q5902502):
Displaying 27 items.
- Approximability of the Subset Sum Reconfiguration Problem (Q3010386) (← links)
- An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree (Q3010389) (← links)
- Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (Q3448854) (← links)
- The Complexity of Dominating Set Reconfiguration (Q3449837) (← links)
- On the Boolean Connectivity Problem for Horn Relations (Q3612466) (← links)
- The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits (Q4981174) (← links)
- Frozen (Δ + 1)-colourings of bounded degree graphs (Q4993126) (← links)
- Congestion-Free Rerouting of Flows on DAGs (Q5002832) (← links)
- Solution-Graphs of Boolean Formulas and Isomorphism1 (Q5015600) (← links)
- (Q5026983) (← links)
- Homomorphism Reconfiguration via Homotopy (Q5212954) (← links)
- Shortest Reconfiguration Paths in the Solution Space of Boolean Formulas (Q5361235) (← links)
- Equivalence of strongly connected graphs and black-and-white 2-SAT problems (Q5379589) (← links)
- Trichotomy for the reconfiguration problem of integer linear systems (Q5896129) (← links)
- Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect (Q5916254) (← links)
- Reconfiguration of Hamiltonian Cycles in Rectangular Grid Graphs (Q6066461) (← links)
- (Q6087216) (← links)
- (Q6089671) (← links)
- Computational complexity of jumping block puzzles (Q6144017) (← links)
- Mixing is hard for triangle-free reflexive graphs (Q6146497) (← links)
- Token sliding on graphs of girth five (Q6182683) (← links)
- Computational complexity of puzzles and related topics (Q6535387) (← links)
- Hamiltonian cycle reconfiguration with answer set programming (Q6545539) (← links)
- Recongo: bounded combinatorial reconfiguration with answer set programming (Q6545541) (← links)
- Combinatorial reconfiguration with answer set programming: algorithms, encodings, and empirical analysis (Q6575399) (← links)
- On connectedness of solutions to integer linear systems (Q6606206) (← links)
- The Hamiltonian path graph is connected for simple \(s,t\) paths in rectangular grid graphs (Q6646753) (← links)
