Pages that link to "Item:Q963360"
From MaRDI portal
The following pages link to On the counting complexity of propositional circumscription (Q963360):
Displayed 4 items.
- The complexity of counting locally maximal satisfying assignments of Boolean CSPs (Q284575) (← links)
- Counting minimal transversals of \(\beta\)-acyclic hypergraphs (Q1713476) (← links)
- Counting Minimal Dominating Sets (Q2988832) (← links)
- Counting Constraint Satisfaction Problems. (Q4993601) (← links)