( en | de | ru )

 

Disambiguation of "Lee, Troy"

Author of the publication

copydeleteadd this publication to your clipboard
Separating quantum communication and approximate rank.

, , , , , and . CoRR, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Stefanie Troy

Peter Troyke

Troy Wilson

Alfonso Luís Troya Chinchilla

Maria Troyer

 

Other publications of authors with the same name

Disjointness is hard in the multi-party number on the forehead model, and . CoRR, (2007)Disjointness is Hard in the Multiparty Number-on-the-Forehead Model., and . Comput. Complex., 18 (2): 309-336 (2009)On the cut dimension of a graph., , , and . CoRR, (2020)On the Sum-of-Squares Degree of Symmetric Quadratic Functions., , , and . CCC, volume 50 of LIPIcs, page 17:1-17:31. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)The Cover Number of a Matrix and its Algorithmic Applications., , and . APPROX-RANDOM, volume 28 of LIPIcs, page 34-47. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)Quantum Complexity of Minimum Cut., and . CCC, volume 200 of LIPIcs, page 28:1-28:33. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)On the Cut Dimension of a Graph., , , and . CCC, volume 200 of LIPIcs, page 15:1-15:35. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Finding the KT Partition of a Weighted Graph in Near-Linear Time., , and . APPROX/RANDOM, volume 245 of LIPIcs, page 32:1-32:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Arithmetical definability over finite structures.. Math. Log. Q., 49 (4): 385-392 (2003)Quantum query complexity of edge connectivity., and . CoRR, (2020)