Pages that link to "Item:Q1879246"
From MaRDI portal
The following pages link to Inapproximability results for set splitting and satisfiability problems with no mixed clauses (Q1879246):
Displaying 9 items.
- Better approximation algorithms for \textsc{Set Splitting} and \textsc{Not-All-Equal Sat} (Q293272) (← links)
- Committee polyhedral separability: complexity and polynomial approximation (Q890319) (← 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)
- Almost envy-freeness for groups: improved bounds via discrepancy theory (Q2166776) (← links)
- Hypergraph cuts above the average (Q2327966) (← links)
- Clustering with qualitative information (Q2568462) (← links)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
- Algorithmic Aspects of Combinatorial Discrepancy (Q5264196) (← links)
