Pages that link to "Item:Q5470714"

The following pages link to Approximating the Cut-Norm via Grothendieck's Inequality (Q5470714):

Displaying 50 items.

• Some new aspects of taxicab correspondence analysis (Q257666) (← links)
• Graph partitioning by correspondence analysis and taxicab correspondence analysis (Q269116) (← links)
• Optimization procedures for the bipartite unconstrained 0-1 quadratic programming problem (Q337120) (← links)
• Approximation algorithms for discrete polynomial optimization (Q384206) (← links)
• Approximation bounds for trilinear and biquadratic optimization problems over nonconvex constraints (Q481050) (← links)
• Average value of solutions for the bipartite Boolean quadratic programs and rounding algorithms (Q482289) (← links)
• The road to deterministic matrices with the restricted isometry property (Q485193) (← links)
• Approximation algorithms for indefinite complex quadratic maximization problems (Q625875) (← links)
• Community detection in sparse networks via Grothendieck's inequality (Q737326) (← links)
• Approximation methods for complex polynomial optimization (Q742305) (← links)
• Convergent sequences of dense graphs. I: Subgraph frequencies, metric properties and testing (Q952421) (← links)
• Norms of random matrices: local and global problems (Q1684656) (← links)
• Graph summarization with quality guarantees (Q1741300) (← links)
• Markov chain methods for the bipartite Boolean quadratic programming problem (Q1753461) (← links)
• The convex geometry of linear inverse problems (Q1928276) (← links)
• On solving biquadratic optimization via semidefinite relaxation (Q1935575) (← links)
• On the maximal size of large-average and ANOVA-fit submatrices in a Gaussian random matrix (Q1940759) (← links)
• Two proposals for robust PCA using semidefinite programming (Q1952221) (← links)
• Long time dynamics for interacting oscillators on graphs (Q2117446) (← links)
• The \(\ell^p\)-Gaussian-Grothendieck problem with vector spins (Q2149938) (← links)
• Mean estimation with sub-Gaussian rates in polynomial time (Q2196216) (← links)
• On the tensor spectral \(p\)-norm and its dual norm via partitions (Q2307701) (← links)
• Grothendieck constant is norm of Strassen matrix multiplication tensor (Q2334621) (← links)
• The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases (Q2355744) (← links)
• Stochastic budget optimization in internet advertising (Q2392928) (← links)
• Parallel stochastic gradient algorithms for large-scale matrix completion (Q2392935) (← links)
• Extremal results in sparse pseudorandom graphs (Q2445889) (← links)
• Integrating tabu search and VLSN search to develop enhanced algorithms: a case study using bipartite Boolean quadratic programs (Q2629716) (← links)
• Quantum XOR Games (Q2828211) (← links)
• Some applications of hypercontractive inequalities in quantum information theory (Q2872466) (← links)
• Grothendieck-Type Inequalities in Combinatorial Optimization (Q2892967) (← links)
• The Communication Complexity of Non-signaling Distributions (Q3182931) (← links)
• (Q3303437) (← links)
• Approximate Kernel Clustering (Q3400770) (← links)
• On a Question of N. Th. Varopoulos and the constant $C_2(n)$ (Q4610378) (← links)
• Semidefinite Approximation of Closed Convex Set (Q4613906) (← links)
• Quantum Query Algorithms Are Completely Bounded Forms (Q4634058) (← links)
• Approximability of the Problem of Finding a Vector Subset with the Longest Sum (Q4973237) (← links)
• Quantum Query Algorithms are Completely Bounded Forms. (Q4993266) (← links)
• Binary Component Decomposition Part I: The Positive-Semidefinite Case (Q4999392) (← links)
• Control analysis and design via randomised coordinate polynomial minimisation (Q5027405) (← links)
• Fast Heuristics and Approximation Algorithms (Q5050148) (← links)
• The Bipartite QUBO (Q5050150) (← links)
• Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking (Q5139848) (← links)
• On the Complexity of Robust PCA and <i>ℓ</i>₁-Norm Low-Rank Matrix Approximation (Q5219689) (← links)
• Moments Tensors, Hilbert's Identity, and <i>k</i>-wise Uncorrelated Random Variables (Q5244868) (← links)
• Probability Bounds for Polynomial Functions in Random Variables (Q5244874) (← links)
• Hardness and Approximation Results for <i>L_p</i>-Ball Constrained Homogeneous Polynomial Optimization Problems (Q5247613) (← links)
• On Regularity Lemmas and their Algorithmic Applications (Q5366957) (← links)
• Grothendieck’s Theorem, past and present (Q5389600) (← links)