Pages that link to "Item:Q3599157"
From MaRDI portal
The following pages link to A New Upper Bound for Max-2-SAT: A Graph-Theoretic Approach (Q3599157):
Displaying 6 items.
- A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between (Q414887) (← links)
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP (Q494789) (← links)
- A new upper bound for Max-2-SAT: A graph-theoretic approach (Q616992) (← links)
- A new lower bound on the maximum number of satisfied clauses in Max-SAT and its algorithmic applications (Q1759685) (← links)
- New upper bounds for the problem of maximal satisfiability (Q3225865) (← links)
- New Upper Bounds for Maximum Satisfiability (Q4500858) (← links)