Pages that link to "Item:Q3503590"
From MaRDI portal
The following pages link to A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances (Q3503590):
Displaying 20 items.
- Solving min ones 2-SAT as fast as vertex cover (Q393120) (← links)
- An exact exponential time algorithm for counting bipartite cliques (Q436594) (← links)
- Exact algorithms for minimum weighted dominating induced matching (Q521800) (← links)
- Exact algorithms for maximum independent set (Q2013558) (← links)
- Faster exponential-time algorithms for approximately counting independent sets (Q2235762) (← links)
- Solving and sampling with many solutions (Q2309479) (← links)
- Fast algorithms for max independent set (Q2428670) (← links)
- On independent sets and bicliques in graphs (Q2428684) (← links)
- Computing the differential of a graph: hardness, approximability and exact algorithms (Q2448922) (← links)
- Exploiting independent subformulas: a faster approximation scheme for \(\# k\)-SAT (Q2450932) (← 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)
- Solving and sampling with many solutions: Satisfiability and other hard problems (Q5111870) (← links)
- Mass Customization and “Forecasting Options’ Penetration Rates Problem” (Q5129183) (← links)
- On Independent Sets and Bicliques in Graphs (Q5302053) (← links)
- Faster graph coloring in polynomial space (Q5925619) (← links)
- Picturing Counting Reductions with the ZH-Calculus (Q6200526) (← links)
- Maximum Weighted Independent Set: Effective Reductions and Fast Algorithms on Sparse Graphs (Q6492080) (← links)
