Pages that link to "Item:Q1770390"
From MaRDI portal
The following pages link to Counting models for 2SAT and 3SAT formulae (Q1770390):
Displaying 25 items.
- An enumerative algorithm for \#2SAT (Q283678) (← links)
- Exact algorithms for minimum weighted dominating induced matching (Q521800) (← links)
- Number of models and satisfiability of sets of clauses (Q672138) (← links)
- The union of minimal hitting sets: parameterized combinatorial bounds and counting (Q1044023) (← links)
- Counting propositional models (Q1197995) (← links)
- Faster exponential-time algorithms for approximately counting independent sets (Q2235762) (← links)
- Algorithms for propositional model counting (Q2266937) (← 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)
- Using binary patterns for counting falsifying assignments of conjunctive forms (Q2520658) (← links)
- Exact algorithms for maximum weighted independent set on sparse graphs (extended abstract) (Q2695332) (← links)
- Counting Maximal Independent Sets in Subcubic Graphs (Q2891379) (← links)
- Counting Independent Sets in Claw-Free Graphs (Q3104779) (← links)
- Rényi entropies as a measure of the complexity of counting problems (Q3301573) (← links)
- О методах оценивания веса булевых биюнктивных функций (Q3382043) (← links)
- A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances (Q3503590) (← links)
- A Method for Computing the Merrifield–Simmons Index on Benzenoid Systems (Q5050764) (← links)
- Mass Customization and “Forecasting Options’ Penetration Rates Problem” (Q5129183) (← links)
- Algorithms for Counting 2-Sat Solutions and Colorings with Applications (Q5434422) (← links)
- Solving NP-Complete Problems with Quantum Search (Q5458579) (← links)
- Theory and Applications of Satisfiability Testing (Q5713713) (← links)
- Faster graph coloring in polynomial space (Q5925619) (← links)
- Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs (Q6492080) (← links)
