Pages that link to "Item:Q1872728"
From MaRDI portal
The following pages link to A linear lower bound on the unbounded error probabilistic communication complexity. (Q1872728):
Displaying 37 items.
- Essential sign change numbers of full sign pattern matrices (Q301845) (← links)
- Linear algebraic methods in communication complexity (Q417541) (← links)
- On a theorem of Razborov (Q445247) (← links)
- Using elimination theory to construct rigid matrices (Q475335) (← links)
- Minimum (maximum) rank of sign pattern tensors and sign nonsingular tensors (Q490877) (← links)
- Unbounded-error quantum query complexity (Q638526) (← links)
- Space lower bounds for low-stretch greedy embeddings (Q896692) (← links)
- Exponential lower bounds on the size of constant-depth threshold circuits with small energy complexity (Q955021) (← links)
- The landscape of communication complexity classes (Q1653337) (← links)
- Algorithmic and optimization aspects of Brascamp-Lieb inequalities, via operator scaling (Q1746610) (← links)
- Minimum ranks of sign patterns and zero-nonzero patterns and point-hyperplane configurations (Q1791686) (← links)
- The Paulsen problem made simple (Q2130546) (← links)
- Revealed preference dimension via matrix sign rank (Q2190381) (← links)
- Ranks of dense alternating sign matrices and their sign patterns (Q2261532) (← links)
- Rank conditions for sign patterns that allow diagonalizability (Q2305912) (← links)
- The unbounded-error communication complexity of symmetric functions (Q2428632) (← links)
- Threshold circuit lower bounds on cryptographic functions (Q2485284) (← links)
- Polynomial threshold functions and Boolean threshold circuits (Q2514146) (← links)
- Nearest neighbor representations of Boolean functions (Q2672259) (← links)
- Dimension-free bounds and structural results in communication complexity (Q2698435) (← links)
- Rational realization of the minimum ranks of nonnegative sign pattern matrices (Q2828823) (← links)
- Sign patterns with minimum rank 2 and upper bounds on minimum ranks (Q2850984) (← links)
- IMPROVED RANK BOUNDS FOR DESIGN MATRICES AND A NEW PROOF OF KELLY’S THEOREM (Q2879417) (← links)
- Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization (Q4575825) (← links)
- Computing the Distance Between Frames and Between Subspaces of a Hilbert Space (Q4609726) (← links)
- Sign rank versus Vapnik-Chervonenkis dimension (Q4610199) (← links)
- Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$ (Q4957911) (← links)
- Spectral Analysis of Matrix Scaling and Operator Scaling (Q4997323) (← links)
- (Q5002761) (← links)
- Weights of exact threshold functions (Q5033984) (← links)
- A Quiver Invariant Theoretic Approach to Radial Isotropy and the Paulsen Problem for Matrix Frames (Q5057035) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- (Q5090418) (← links)
- (Q5091179) (← links)
- (Q5158501) (← links)
- (Q5228561) (← links)
- Unbounded-Error Classical and Quantum Communication Complexity (Q5387749) (← links)
