Pages that link to "Item:Q2437759"

The following pages link to New exact algorithms for the 2-constraint satisfaction problem (Q2437759):

Displaying 7 items.

• A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
• A faster polynomial-space algorithm for Max 2-CSP (Q899585) (← links)
• Improved exact algorithms for mildly sparse instances of MAX SAT (Q2405896) (← links)
• $K_4$-Minor-Free Induced Subgraphs of Sparse Connected Graphs (Q3130446) (← links)
• Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets (Q3448816) (← links)
• Improved Algorithms for Sparse MAX-SAT and MAX-k-CSP (Q3453207) (← links)
• (Q4578331) (← links)