( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Even 1×n Edge-Matching and Jigsaw Puzzles are Really Hard.

, , , , , и . CoRR, (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.

Walter Pasinato

Enrico Pasin

Marcia Pasin

Attila Pasinli

Samuele Pasini

 

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

Even 1×n Edge-Matching and Jigsaw Puzzles are Really Hard., , , , , и . CoRR, (2017)Almost-Polynomial Ratio ETH-Hardness of Approximating Densest k-Subgraph.. Electron. Colloquium Comput. Complex., (2016)Improved Lower Bound for Differentially Private Facility Location.. CoRR, (2024)The Price of Justified Representation., , , , , и . AAAI, стр. 4983-4990. AAAI Press, (2022)Deep Learning with Label Differential Privacy., , , , и . NeurIPS, стр. 27131-27145. (2021)A Note on Max k-Vertex Cover: Faster FPT-AS, Smaller Approximate Kernel and Improved Approximation.. SOSA, том 69 из OASIcs, стр. 15:1-15:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Improved Inapproximability of VC Dimension and Littlestone's Dimension via (Unbalanced) Biclique.. ITCS, том 251 из LIPIcs, стр. 85:1-85:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Algorithms with More Granular Differential Privacy Guarantees., , , и . ITCS, том 251 из LIPIcs, стр. 54:1-54:24. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Cryptographic Hardness of Learning Halfspaces with Massart Noise., , , и . NeurIPS, (2022)Private Robust Estimation by Stabilizing Convex Relaxations., , и . COLT, том 178 из Proceedings of Machine Learning Research, стр. 723-777. PMLR, (2022)