Pages that link to "Item:Q1770390"
From MaRDI portal
The following pages link to Counting models for 2SAT and 3SAT formulae (Q1770390):
Displayed 9 items.
- The union of minimal hitting sets: parameterized combinatorial bounds and counting (Q1044023) (← links)
- New upper bound for the \#3-SAT problem (Q2380029) (← links)
- Linear-programming design and analysis of fast algorithms for Max 2-CSP (Q2427689) (← links)
- Fast algorithms for max independent set (Q2428670) (← links)
- On independent sets and bicliques in graphs (Q2428684) (← links)
- Counting Maximal Independent Sets in Subcubic Graphs (Q2891379) (← links)
- Counting Independent Sets in Claw-Free Graphs (Q3104779) (← links)
- A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances (Q3503590) (← links)
- Solving NP-Complete Problems with Quantum Search (Q5458579) (← links)