Pages that link to "Item:Q1367267"
From MaRDI portal
The following pages link to A polynomial-time algorithm for reducing the number of variables in MAX SAT problem (Q1367267):
Displaying 6 items.
- On semidefinite least squares and minimal unsatisfiability (Q516798) (← links)
- Lean clause-sets: Generalizations of minimally unsatisfiable clause-sets (Q1408381) (← links)
- A polynomial-time reduction from the 3SAT problem to the generalized string puzzle problem (Q1736511) (← links)
- Investigations on autark assignments (Q1841885) (← links)
- (Q3011193) (← links)
- SAT-Problems and Reductions with Respect to the Number of Variables (Q4351797) (← links)