The following pages link to (Q3002828):
Displaying 11 items.
- Complexity of approximating CSP with balance/hard constraints (Q315529) (← links)
- Combinatorial optimization. Abstracts from the workshop held November 9--15, 2014. (Q347232) (← links)
- New techniques for approximating optimal substructure problems in power-law graphs (Q443723) (← links)
- Independent sets in semi-random hypergraphs (Q832900) (← links)
- Recoverable Values for Independent Sets (Q3012827) (← links)
- (Q5075740) (← links)
- Approximation in (Poly-) Logarithmic Space (Q5089177) (← links)
- UG-hardness to NP-hardness by losing half (Q5091753) (← links)
- Simultaneous max-cut is harder to approximate than max-cut (Q5092456) (← links)
- Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder (Q5875476) (← links)
- Mathematics of computation through the lens of linear equations and lattices (Q6198651) (← links)
