( en | de | ru )

 

Disambiguation of "Manurangsi, Pasin"

Author of the publication

copydeleteadd this publication to your clipboard
Dissection with the Fewest Pieces is Hard, Even to Approximate.

, , , , , , and . CoRR, (2015)

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.

Walter Pasinato

Enrico Pasin

Marcia Pasin

Attila Pasinli

Samuele Pasini

 

Other publications of authors with the same name

Inapproximability of Maximum Biclique Problems, Minimum $k$-Cut and Densest At-Least-$k$-Subgraph from the Small Set Expansion Hypothesis.. CoRR, (2017)A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs., and . CoRR, (2016)Multitasking Capacity: Hardness Results and Improved Constructions., , , , , , , and . SIAM J. Discret. Math., 34 (1): 885-903 (2020)On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results., and . Electron. Colloquium Comput. Complex., (2024)On Differentially Private Sampling from Gaussian and Product Distributions., , , and . CoRR, (2023)Differentially Private All-Pairs Shortest Path Distances: Improved Algorithms and Lower Bounds., , , and . CoRR, (2022)Private Rank Aggregation in Central and Local Models., , , and . CoRR, (2021)Pure-DP Aggregation in the Shuffle Model: Error-Optimal and Communication-Efficient., , and . CoRR, (2023)Improved FPT Approximation Scheme and Approximate Kernel for Biclique-Free Max k-Weight SAT: Greedy Strikes Back.. CoRR, (2024)Summary Reports Optimization in the Privacy Sandbox Attribution Reporting API., , , , , , and . CoRR, (2023)