The following pages link to (Q5743406):
Displaying 28 items.
- Complexity of approximating CSP with balance/hard constraints (Q315529) (← links)
- An approximation algorithm for the balanced Max-3-Uncut problem using complex semidefinite programming rounding (Q346478) (← links)
- A bounded-error quantum polynomial-time algorithm for two graph bisection problems (Q747789) (← links)
- Information-theoretic thresholds from the cavity method (Q1649349) (← links)
- Bethe states of random factor graphs (Q1733816) (← links)
- Lift-and-project methods for set cover and knapsack (Q1799231) (← links)
- An SDP randomized approximation algorithm for max hypergraph cut with limited unbalance (Q2018887) (← links)
- Optimization over the Boolean hypercube via sums of nonnegative circuit polynomials (Q2143214) (← links)
- Taming correlations through entropy-efficient measure decompositions with applications to mean-field approximation (Q2174660) (← links)
- Speeding up a memetic algorithm for the max-bisection problem (Q2353470) (← links)
- An improved semidefinite programming hierarchies rounding approximation algorithm for maximum graph bisection problems (Q2354294) (← links)
- Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix (Q2358291) (← links)
- Quantum de Finetti theorems under local measurements with applications (Q2358805) (← links)
- Improved approximation algorithms for the max-bisection and the disjoint 2-catalog segmentation problems (Q2444145) (← links)
- Computing densest \(k\)-subgraph with structural parameters (Q2680362) (← links)
- Simultaneous Approximation of Constraint Satisfaction Problems (Q3448785) (← links)
- On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy (Q3448844) (← links)
- The Cut Metric for Probability Distributions (Q4992835) (← links)
- A (1+epsilon)-Approximation for Makespan Scheduling with Precedence Constraints Using LP Hierarchies (Q4997320) (← links)
- (Q5005186) (← links)
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) (← links)
- (Q5091238) (← links)
- Sherali-adams strikes back (Q5091758) (← links)
- Global Cardinality Constraints Make Approximating Some Max-2-CSPs Harder (Q5875476) (← links)
- Product-state approximations to quantum states (Q5962905) (← links)
- A maximum hypergraph 3-cut problem with limited unbalance: approximation and analysis (Q6064054) (← links)
- The rank of sparse random matrices (Q6077051) (← links)
- Lower tails via relative entropy (Q6102952) (← links)
