Searching for authors named "Troy Lee" – sorted by Relevance.
-
Arithmetical Definability over Finite Structures
- Arithmetical Denability over Finite Structures Troy Lee CWI, PO Box 94079, 1090 GB Amsterdam
- Cited by 2 (0 self) – Add To MetaCart
-
A new rank technique for formula size lower bounds
- A new rank technique for formula size lower bounds Troy Lee£ troyjlee@(email omitted); Abstract We
- Cited by 1 (0 self) – Add To MetaCart
-
Is Multiplication Harder than Addition? Arithmetical Definability over Finite Structures
- Is Multiplication Harder than Addition? Arithmetical Denability over Finite Structures Troy Lee
- Add To MetaCart
-
Negative weights make adversaries stronger
- Negative weights make adversaries stronger Peter Høyer ∗ hoyer@(email omitted); Troy Lee † lee
- Cited by 7 (2 self) – Add To MetaCart
-
A direct product theorem for discrepancy
- A direct product theorem for discrepancy Troy Lee Department of Computer Science Rutgers
- Cited by 5 (3 self) – Add To MetaCart
-
Lower Bounds in Communication Complexity: A Survey
- Lower Bounds in Communication Complexity: A Survey Troy Lee Columbia University Adi Shraibman
- Add To MetaCart
-
Kolmogorov Complexity with Error
- Kolmogorov Complexity with Error Lance Fortnow 1 , Troy Lee 2 , and Nikolai Vereshchagin 3,⋆ 1
- Cited by 2 (2 self) – Add To MetaCart
-
Lower bounds on quantum multiparty communication complexity
- Lower bounds on quantum multiparty communication complexity Troy Lee Department of Computer
- Cited by 1 (1 self) – Add To MetaCart
-
The quantum adversary method and classical formula size lower bounds
- by Ambainis [Amb03], and the collision problem. Troy Lee CWI and University of Amsterdam Troy.Lee@(email omitted); Mario
- Cited by 12 (7 self) – Add To MetaCart
-
Kolmogorov complexity and formula size lower bounds
- Kolmogorov Complexity and Formula Size Lower Bounds Troy Lee Kolmogorov Complexity and Formula
- Cited by 1 (1 self) – Add To MetaCart

