Pages that link to "Item:Q949752"

The following pages link to Complexity measures of sign matrices (Q949752):

Displaying 29 items.

• Matrix completion via max-norm constrained optimization (Q302432) (← links)
• A strong direct product theorem for quantum query complexity (Q354645) (← links)
• Minimum (maximum) rank of sign pattern tensors and sign nonsingular tensors (Q490877) (← links)
• A generalized Grothendieck inequality and nonlocal correlations that require high entanglement (Q635824) (← links)
• Max-norm optimization for robust matrix recovery (Q681486) (← links)
• Large violation of Bell inequalities with low entanglement (Q717112) (← links)
• Positive semidefinite rank (Q745689) (← links)
• The corruption bound, log-rank, and communication complexity (Q1621501) (← links)
• Classical versus quantum communication in XOR games (Q1654152) (← links)
• Identifying complexity by means of matrices (Q1850374) (← links)
• The hardest halfspace (Q1983325) (← links)
• Upper bounds on communication in terms of approximate rank (Q2117081) (← links)
• Approximate nonnegative rank is equivalent to the smooth rectangle bound (Q2422764) (← links)
• Kolmogorov width and approximate rank (Q2423217) (← links)
• Sign patterns with minimum rank 2 and upper bounds on minimum ranks (Q2850984) (← links)
• Grothendieck-type inequalities in combinatorial optimization (Q2892967) (← links)
• The Communication Complexity of Non-signaling Distributions (Q3182931) (← links)
• Lipschitz representations of subsets of the cube (Q3425994) (← links)
• Learning Complexity vs Communication Complexity (Q3557511) (← links)
• TIGHTER BOUNDS FOR THE DISCREPANCY OF BOXES AND POLYTOPES (Q4604484) (← links)
• Knowledge Graph Completion via Complex Tensor Factorization (Q4637058) (← links)
• Sign rank vs discrepancy (Q5092468) (← links)
• The Hilbertian tensor norm and entangled two-prover games (Q5135833) (← links)
• Deterministic Tensor Completion with Hypergraph Expanders (Q5162629) (← links)
• An Additive Combinatorics Approach Relating Rank to Communication Complexity (Q5501927) (← links)
• Spectral gap in random bipartite biregular graphs and applications (Q5886318) (← links)
• Lower bounds in communication complexity based on factorization norms (Q5902088) (← links)
• Communication and information complexity (Q6200329) (← links)
• Upper bounds on communication in terms of approximate rank (Q6635689) (← links)