Pages that link to "Item:Q1770390"

The following pages link to Counting models for 2SAT and 3SAT formulae (Q1770390):

Displayed 5 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)
• A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances (Q3503590) ‎ (← links)
• Solving NP-Complete Problems with Quantum Search (Q5458579) ‎ (← links)