Pages that link to "Item:Q293272"
From MaRDI portal
The following pages link to Better approximation algorithms for \textsc{Set Splitting} and \textsc{Not-All-Equal Sat} (Q293272):
Displaying 8 items.
- Approximating Max NAE-\(k\)-SAT by anonymous local search (Q507440) (← links)
- Improved parameterized set splitting algorithms: A Probabilistic approach (Q1040647) (← links)
- Improved approximations for max set splitting and max NAE SAT (Q1878408) (← links)
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
- Local Search to Approximate Max NAE-$$k$$-Sat Tightly (Q3452574) (← links)
- A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis (Q6064054) (← links)
