Pages that link to "Item:Q2904751"

The following pages link to An approximation algorithm for \(\#k\)-SAT (Q2904751):

Displaying 8 items.

• The relative exponential time complexity of approximate counting satisfying assignments (Q309794) (← links)
• A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. (Q1853552) (← links)
• Exploiting independent subformulas: a faster approximation scheme for \(\# k\)-SAT (Q2450932) (← links)
• The Relative Exponential Time Complexity of Approximate Counting Satisfying Assignments (Q2946032) (← links)
• On the <i>K</i>‐sat model with large number of clauses (Q4642745) (← links)
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313044) (← links)
• Theory and Applications of Satisfiability Testing (Q5325871) (← links)
• On approximability of satisfiable <i>k</i> -CSPs: I (Q6083552) (← links)