The following pages link to Troy Lee (Q295640):
Displayed 44 items.
- Hellinger volume and number-on-the-forehead communication complexity (Q295642) (← links)
- A strong direct product theorem for quantum query complexity (Q354645) (← links)
- Improved quantum query algorithms for triangle detection and associativity testing (Q513275) (← links)
- Some upper and lower bounds on PSD-rank (Q517316) (← links)
- Disjointness is hard in the multiparty number-on-the-forehead model (Q626627) (← links)
- All Schatten spaces endowed with the Schur product are \(Q\)-algebras (Q652427) (← links)
- Language compression and pseudorandom generators (Q813317) (← links)
- Information-theoretic approximations of the nonnegative rank (Q2012181) (← links)
- Fooling-sets and rank (Q2346587) (← links)
- The quantum adversary method and classical formula size power bounds (Q2458941) (← links)
- Resource bounded symmetry of information revisited (Q2575757) (← links)
- New bounds on the classical and quantum communication complexity of some graph properties (Q2957488) (← links)
- The Cover Number of a Matrix and its Algorithmic Applications (Q2969040) (← links)
- Lower Bounds in Communication Complexity (Q3404184) (← links)
- Query Complexity in Expectation (Q3448835) (← links)
- Product Theorems Via Semidefinite Programming (Q3521958) (← links)
- Optimal Quantum Adversary Lower Bounds for Ordered Search (Q3521972) (← links)
- (Q3549652) (← links)
- Composition Theorems in Communication Complexity (Q3587401) (← links)
- A New Rank Technique for Formula Size Lower Bounds (Q3590928) (← links)
- Arithmetical definability over finite structures (Q4419268) (← links)
- How Information-Mapping Patterns Determine Foraging Behaviour of a Honey Bee Colony (Q4547078) (← links)
- Separations in Query Complexity Based on Pointer Functions (Q4640297) (← links)
- (Q5090429) (← links)
- (Q5090458) (← links)
- (Q5091164) (← links)
- (Q5091221) (← links)
- (Q5111154) (← links)
- A Composition Theorem for Randomized Query Complexity (Q5136299) (← links)
- Query Complexity (Q5218478) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311121) (← links)
- On the sum-of-squares degree of symmetric quadratic functions (Q5368751) (← links)
- (Q5414605) (← links)
- Kolmogorov Complexity with Error (Q5449793) (← links)
- Quantum Query Complexity of State Conversion (Q5494975) (← links)
- The approximate rank of a matrix and its algorithmic applications (Q5495838) (← links)
- Improved Quantum Query Algorithms for Triangle Finding and Associativity Testing (Q5741816) (← links)
- Quadratically tight relations for randomized query complexity (Q5915578) (← links)
- Around the log-rank conjecture (Q6050267) (← links)
- On the cut dimension of a graph (Q6115369) (← links)
- Quantum complexity of minimum cut (Q6115391) (← links)
- (Q6138069) (← links)
- (Q6147309) (← links)
- Rank and fooling set size (Q6245965) (← links)