The following pages link to (Q3549708):
Displayed 50 items.
- Bounds on 2-query locally testable codes with affine tests (Q280942) (← links)
- Approximating the little Grothendieck problem over the orthogonal and unitary groups (Q344957) (← links)
- Enumerating homomorphisms (Q414933) (← links)
- Spectral algorithms for unique games (Q645126) (← links)
- On the complexity of submodular function minimisation on diamonds (Q665998) (← links)
- Hard constraint satisfaction problems have hard gaps at location 1 (Q837178) (← links)
- Extended formulation for CSP that is compact for instances of bounded treewidth (Q907218) (← links)
- Noise stability of functions with low influences: invariance and optimality (Q974039) (← links)
- Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
- Notes on computational-to-statistical gaps: predictions using statistical physics (Q1729830) (← links)
- Random Laplacian matrices and convex relaxations (Q1750385) (← links)
- Maximally stable Gaussian partitions with discrete applications (Q1760364) (← links)
- Lift-and-project methods for set cover and knapsack (Q1799231) (← links)
- Noise correlation bounds for uniform low degree functions (Q1944763) (← links)
- Lift \& project systems performing on the partial-vertex-cover polytope (Q1989348) (← links)
- An approximation algorithm for the maximum spectral subgraph problem (Q2082202) (← links)
- On regularity of Max-CSPs and Min-CSPs (Q2122790) (← links)
- On computational capabilities of Ising machines based on nonlinear oscillators (Q2150420) (← links)
- Sum-of-squares hierarchy lower bounds for symmetric formulations (Q2191774) (← links)
- Gaussian bounds for noise correlation of resilient functions (Q2303682) (← links)
- Grothendieck constant is norm of Strassen matrix multiplication tensor (Q2334621) (← links)
- Robust dimension free isoperimetry in Gaussian space (Q2352746) (← links)
- Improved approximating \(2\)-CatSP for \(\sigma\geq 0.50\) with an unbalanced rounding matrix (Q2358291) (← links)
- Gaussian bounds for noise correlation of functions (Q2379368) (← links)
- Computational protein design as an optimization problem (Q2453727) (← links)
- Survey on nonlocal games and operator space theory (Q2786626) (← links)
- Convex Relaxations and Integrality Gaps (Q2802523) (← links)
- Semidefinite Programming and Constraint Programming (Q2802541) (← links)
- Half-integrality, LP-branching, and FPT Algorithms (Q2816829) (← links)
- Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits (Q2817792) (← links)
- Robustly Solvable Constraint Satisfaction Problems (Q2817797) (← links)
- Properties of an Approximability-related Parameter on Circular Complete Graphs (Q2840526) (← links)
- (Q2941638) (← links)
- New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover (Q2943894) (← links)
- Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack (Q3009771) (← links)
- Nearly Optimal NP-Hardness of Vertex Cover on k-Uniform k-Partite Hypergraphs (Q3088105) (← links)
- On Khot’s unique games conjecture (Q3109809) (← links)
- Nonnegative Weighted #CSP: An Effective Complexity Dichotomy (Q3179267) (← links)
- Dimension-free L2 maximal inequality for spherical means in the hypercube (Q3191610) (← links)
- Approximability Distance in the Space of H-Colourability Problems (Q3392945) (← links)
- Simultaneous Approximation of Constraint Satisfaction Problems (Q3448785) (← links)
- Lower Bounds for the Graph Homomorphism Problem (Q3448809) (← links)
- Approximating CSPs Using LP Relaxation (Q3448840) (← links)
- Sherali-Adams Relaxations for Valued CSPs (Q3448860) (← links)
- Improved Approximation Guarantees through Higher Levels of SDP Hierarchies (Q3541786) (← links)
- (Q4568111) (← links)
- On the Complexity of Random Satisfiability Problems with Planted Solutions (Q4577186) (← links)
- Bi-Covering: Covering Edges with Two Small Subsets of Vertices (Q4596825) (← links)
- Convex Algebraic Geometry of Curvature Operators (Q4991379) (← links)
- ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network (Q4993301) (← links)