Pages that link to "Item:Q5415483"
From MaRDI portal
The following pages link to Hypercontractivity, sum-of-squares proofs, and their applications (Q5415483):
Displaying 46 items.
- An improved semidefinite programming hierarchy for testing entanglement (Q529619) (← links)
- Generic properties and a criterion of an operator norm (Q745174) (← links)
- Tight size-degree bounds for sums-of-squares proofs (Q1686838) (← links)
- Limitations of semidefinite programs for separable states and entangled games (Q1731116) (← links)
- Lift-and-project methods for set cover and knapsack (Q1799231) (← links)
- The global convergence of the nonlinear power method for mixed-subordinate matrix norms (Q2049097) (← links)
- Optimization of mean-field spin glasses (Q2072085) (← links)
- Noisy tensor completion via the sum-of-squares hierarchy (Q2144539) (← links)
- Semidefinite programming hierarchies for constrained bilinear optimization (Q2149569) (← links)
- Sum-of-squares hierarchy lower bounds for symmetric formulations (Q2191774) (← links)
- The sum-of-squares hierarchy on the sphere and applications in quantum information theory (Q2235150) (← links)
- Quantum de Finetti theorems under local measurements with applications (Q2358805) (← links)
- Hypercontractivity for semigroups of unital qubit channels (Q2452201) (← links)
- Hypercontractivity via tensor calculus (Q2695312) (← links)
- Hypercontractive inequalities via SOS, and the Frankl-Rödl graph (Q2826231) (← links)
- Some applications of hypercontractive inequalities in quantum information theory (Q2872466) (← links)
- On the Hardest Problem Formulations for the 0/1 Lasserre Hierarchy (Q2976145) (← links)
- On the Hardest Problem Formulations for the $$0/1$$ Lasserre Hierarchy (Q3448844) (← links)
- Approximation Limits of Linear Programs (Beyond Hierarchies) (Q3449458) (← links)
- Making the Long Code Shorter (Q3449561) (← links)
- A Nearly Tight Sum-of-Squares Lower Bound for the Planted Clique Problem (Q4634034) (← links)
- Graph Matrices: Norm Bounds and Applications (Q4636473) (← links)
- Sum-of-squares certificates for maxima of random tensors on the sphere (Q5002634) (← links)
- (Q5009507) (← links)
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) (← links)
- (Q5090427) (← links)
- Size-degree trade-offs for sums-of-squares and positivstellensatz proofs (Q5091776) (← links)
- Sum of squares bounds for the ordering principle (Q5092489) (← links)
- Certifying Unstability of Switched Systems Using Sum of Squares Programming (Q5130926) (← links)
- Hypercontractivity in finite-dimensional matrix algebras (Q5178171) (← links)
- Moments Tensors, Hilbert's Identity, and <i>k</i>-wise Uncorrelated Random Variables (Q5244868) (← links)
- Narrow Proofs May Be Maximally Long (Q5277920) (← links)
- Hypercontractive inequalities via SOS, and the Frankl–Rödl graph (Q5384081) (← links)
- Multi-way spectral partitioning and higher-order cheeger inequalities (Q5415539) (← links)
- Inapproximability of Matrix \(\boldsymbol{p \rightarrow q}\) Norms (Q5885598) (← links)
- A note on the Hausdorff distance between norm balls and their linear maps (Q6052489) (← links)
- Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem (Q6081762) (← links)
- Pseudorandom sets in Grassmann graph have near-perfect expansion (Q6101019) (← links)
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization (Q6165592) (← links)
- Optimizing mean field spin glasses with external field (Q6186448) (← links)
- Approximate orthogonality of permutation operators, with application to quantum information (Q6187142) (← links)
- Mathematics of computation through the lens of linear equations and lattices (Q6198651) (← links)
- Semialgebraic proofs, IPS lower bounds, and the \(\tau\)-conjecture: can a natural number be negative? (Q6562829) (← links)
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 12--17, 2023 (Q6613397) (← links)
- First-order reasoning and efficient semi-algebraic proofs (Q6614038) (← links)
- Tight Lipschitz hardness for optimizing mean field spin glasses (Q6641018) (← links)
