Pages that link to "Item:Q3453207"

The following pages link to Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP (Q3453207):

Displaying 13 items.

• Gate elimination: circuit size lower bounds and \#SAT upper bounds (Q1704573) (← links)
• Probabilistic characterization of random Max \(r\)-Sat (Q2042075) (← links)
• Using the method of conditional expectations to supply an improved starting point for CCLS (Q2091119) (← links)
• A \#SAT algorithm for small constant-depth circuits with PTF gates (Q2118395) (← links)
• Bounded depth circuits with weighted symmetric gates: satisfiability, lower bounds and compression (Q2316930) (← links)
• Improved exact algorithms for mildly sparse instances of MAX SAT (Q2405896) (← links)
• CHAMP: a multipass algorithm for Max Sat based on saver variables (Q2688471) (← links)
• Go-MOCE: greedy order method of conditional expectations for Max Sat (Q2691199) (← links)
• The Normalized Autocorrelation Length of Random Max  $$r$$ -Sat Converges in Probability to $$(1-1/2^r)/r$$ (Q2818001) (← links)
• (Q5009542) (← links)
• (Q5028438) (← links)
• (Q5090378) (← links)
• Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity (Q5091770) (← links)