( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Separating Quantum Communication and Approximate Rank.

, , , , , и . Computational Complexity Conference, том 79 из LIPIcs, стр. 24:1-24:33. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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.

Stefanie Troy

Peter Troyke

Troy Wilson

Alfonso Luís Troya Chinchilla

Maria Troyer

 

Другие публикации лиц с тем же именем

On the cut dimension of a graph., , , и . CoRR, (2020)Disjointness is Hard in the Multiparty Number-on-the-Forehead Model., и . Comput. Complex., 18 (2): 309-336 (2009)Disjointness is hard in the multi-party number on the forehead model, и . CoRR, (2007)The Cover Number of a Matrix and its Algorithmic Applications., , и . APPROX-RANDOM, том 28 из LIPIcs, стр. 34-47. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2014)On the Sum-of-Squares Degree of Symmetric Quadratic Functions., , , и . CCC, том 50 из LIPIcs, стр. 17:1-17:31. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Quantum Complexity of Minimum Cut., и . CCC, том 200 из LIPIcs, стр. 28:1-28:33. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)On the Cut Dimension of a Graph., , , и . CCC, том 200 из LIPIcs, стр. 15:1-15:35. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Finding the KT Partition of a Weighted Graph in Near-Linear Time., , и . APPROX/RANDOM, том 245 из LIPIcs, стр. 32:1-32:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Kolmogorov Complexity with Error., , и . STACS, том 3884 из Lecture Notes in Computer Science, стр. 137-148. Springer, (2006)Language Compression and Pseudorandom Generators., , и . CCC, стр. 15-28. IEEE Computer Society, (2004)