Pages that link to "Item:Q3404184"
From MaRDI portal
The following pages link to Lower Bounds in Communication Complexity (Q3404184):
Displaying 24 items.
- Heuristics for exact nonnegative matrix factorization (Q288239) (← links)
- Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank (Q304255) (← links)
- Lower bounds on nonnegative rank via nonnegative nuclear norms (Q745679) (← links)
- Information complexity and applications. (Q1731897) (← links)
- Counting the number of perfect matchings, and generalized decision trees (Q2044128) (← links)
- Upper bounds on communication in terms of approximate rank (Q2117081) (← links)
- Approximate nonnegative rank is equivalent to the smooth rectangle bound (Q2422764) (← links)
- Bounds on the number of 2-level polytopes, cones, and configurations (Q2664102) (← links)
- Dimension-free bounds and structural results in communication complexity (Q2698435) (← links)
- Fooling Pairs in Randomized Communication Complexity (Q2835016) (← links)
- Grothendieck-Type Inequalities in Combinatorial Optimization (Q2892967) (← links)
- Tight Bounds on Communication Complexity of Symmetric XOR Functions in One-Way and SMP Models (Q3010420) (← links)
- Amplification of One-Way Information Complexity via Codes and Noise Sensitivity (Q3448852) (← links)
- Lower Bounds on Information Complexity via Zero-Communication Protocols and Applications (Q3449568) (← links)
- (Q4993274) (← links)
- Exponential Separation of Communication and External Information (Q4997310) (← links)
- (Q5009504) (← links)
- Approximate Degree in Classical and Quantum Computing (Q5060675) (← links)
- (Q5090396) (← links)
- (Q5092483) (← links)
- A Lifting Theorem with Applications to Symmetric Functions (Q5136315) (← links)
- Quantum State Complexity of Formal Languages (Q5500700) (← links)
- String Matching: Communication, Circuits, and Learning. (Q5875515) (← links)
- Around the log-rank conjecture (Q6050267) (← links)
