Pages that link to "Item:Q3225865"
From MaRDI portal
The following pages link to New upper bounds for the problem of maximal satisfiability (Q3225865):
Displaying 13 items.
- 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)
- A tighter upper bound for random MAX \(2\)-SAT (Q1944049) (← links)
- Algorithms for \((n,3)\)-MAXSAT and parameterization above the all-true assignment (Q2283027) (← links)
- New exact algorithms for the 2-constraint satisfaction problem (Q2437759) (← links)
- Solving SCS for bounded length strings in fewer than \(2^n\) steps (Q2448115) (← links)
- New Upper Bounds for MAX-2-SAT and MAX-2-CSP w.r.t. the Average Variable Degree (Q2891341) (← links)
- New Bounds for MAX-SAT by Clause Learning (Q3499776) (← links)
- New Upper Bounds for Maximum Satisfiability (Q4500858) (← links)
- Achieving new upper bounds for the hypergraph duality problem through logic (Q4635628) (← links)
- From SAT to Maximum Independent Set: A New Approach to Characterize Tractable Classes (Q4645742) (← links)
- (Q5150602) (← links)
- (Q5417644) (← links)
