Pages that link to "Item:Q1780843"
From MaRDI portal
The following pages link to Approximating MIN 2-SAT and MIN 3-SAT (Q1780843):
Displaying 21 items.
- Solving min ones 2-SAT as fast as vertex cover (Q393120) (← links)
- Exclusive graph searching vs. pathwidth (Q729824) (← links)
- On the minimum satisfiability problem (Q779212) (← links)
- Minimum 2SAT-DELETION: Inapproximability results and relations to minimum vertex cover (Q867859) (← links)
- Differential approximation of MIN SAT, MAX SAT and related problems (Q877035) (← links)
- On the minimum hitting set of bundles problem (Q1035686) (← links)
- A bounded approximation for the minimum cost 2-sat problem (Q1193517) (← links)
- On approximation algorithms for the minimum satisfiability problem (Q1351157) (← links)
- On residual approximation in solution extension problems (Q1631675) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- Optimizing with minimum satisfiability (Q1761303) (← links)
- Approximating a generalization of MAX 2SAT and MIN 2SAT (Q1841882) (← links)
- Differential approximation for optimal satisfiability and related problems (Q1869721) (← links)
- Improved approximation algorithms for minimum AND-circuits problem via \(k\)-set cover (Q1944076) (← links)
- A primal-dual approximation algorithm for \textsc{minsat} (Q2161258) (← links)
- Approximation algorithms and hardness results for labeled connectivity problems (Q2426652) (← links)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
- On Residual Approximation in Solution Extension Problems (Q2958338) (← links)
- Lower and Upper Bounds for Random Mimimum Satisfiability Problem (Q3452557) (← links)
- On the Minimum Hitting Set of Bundles Problem (Q3511409) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311102) (← links)
