Pages that link to "Item:Q608293"
From MaRDI portal
The following pages link to On the Boolean connectivity problem for Horn relations (Q608293):
Displaying 10 items.
- Approximability of the subset sum reconfiguration problem (Q489711) (← links)
- An exact algorithm for the Boolean connectivity problem for \(k\)-CNF (Q638525) (← links)
- Introduction to reconfiguration (Q2331456) (← links)
- The connectivity of Boolean satisfiability: dichotomies for formulas and circuits (Q2411031) (← links)
- A reconfigurations analogue of Brooks' theorem and its consequences (Q2833252) (← links)
- On the Boolean Connectivity Problem for Horn Relations (Q3612466) (← links)
- Combinatorial Problems for Horn Clauses (Q3655139) (← links)
- The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits (Q4981174) (← links)
- The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies (Q5902502) (← links)
- Reconfiguration of satisfying assignments and subset sums: easy to find, hard to connect (Q5916254) (← links)