Pages that link to "Item:Q1777405"
From MaRDI portal
The following pages link to Generalizations of matched CNF formulas (Q1777405):
Displaying 7 items.
- Complexity of secure sets (Q722534) (← links)
- Backdoor sets of quantified Boolean formulas (Q1040783) (← links)
- Minimal unsatisfiable formulas with bounded clause-variable difference are fixed-parameter tractable (Q1765303) (← links)
- Coherent network partitions (Q2026346) (← links)
- Coherent network partitions: characterizations with cographs and prime graphs (Q2243575) (← links)
- Complexity of Secure Sets (Q2827802) (← links)
- Beyond the Existential Theory of the Reals (Q6489317) (← links)
