( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Symmetries, Graph Properties, and Quantum Speedups.

, , , , , и . FOCS, стр. 649-660. IEEE, (2020)

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.

Marc Podder

Chiraranjan Podder

 

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

Decision Tree Complexity versus Block Sensitivity and Degree., , и . CoRR, (2022)Symmetries, Graph Properties, and Quantum Speedups., , , , , и . FOCS, стр. 649-660. IEEE, (2020)Communication Memento: Memoryless Communication Complexity., и . ITCS, том 185 из LIPIcs, стр. 61:1-61:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Quantum Query Complexity of Subgraph Isomorphism and Homomorphism., и . STACS, том 47 из LIPIcs, стр. 48:1-48:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Graph Properties in Node-Query Setting: Effect of Breaking Symmetry., , , и . MFCS, том 58 из LIPIcs, стр. 17:1-17:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Secure Software Leasing Without Assumptions., , , , и . TCC (1), том 13042 из Lecture Notes in Computer Science, стр. 90-120. Springer, (2021)On the Fine-Grained Query Complexity of Symmetric Functions., , и . ISAAC, том 283 из LIPIcs, стр. 55:1-55:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Decision Tree Complexity Versus Block Sensitivity and Degree., , и . FSTTCS, том 284 из LIPIcs, стр. 27:1-27:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)