Pages that link to "Item:Q385062"
From MaRDI portal
The following pages link to Satisfiability of acyclic and almost acyclic CNF formulas (Q385062):
Displayed 17 items.
- Tractability in constraint satisfaction problems: a survey (Q271997) (← links)
- Model counting for CNF formulas of bounded modular treewidth (Q334935) (← links)
- Backdoors for linear temporal logic (Q1725638) (← links)
- Tractability beyond \(\beta\)-acyclicity for conjunctive queries with negation and SAT (Q2110380) (← links)
- New width parameters for SAT and \#SAT (Q2238644) (← links)
- Backdoors to planning (Q2321271) (← links)
- Paradigms for parameterized enumeration (Q2398214) (← links)
- Complexity and approximability of parameterized MAX-CSPs (Q2408203) (← links)
- Parameterized Compilation Lower Bounds for Restricted CNF-Formulas (Q2817997) (← links)
- Strong Backdoors for Default Logic (Q2818000) (← links)
- On Compiling CNFs into Structured Deterministic DNNFs (Q3453225) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- (Q5111886) (← links)
- (Q5874480) (← links)
- On optimization problems in acyclic hypergraphs (Q6161450) (← links)
- Are hitting formulas hard for resolution? (Q6162037) (← links)
- On the complexity of binary polynomial optimization over acyclic hypergraphs (Q6174810) (← links)