Author of the publication

On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results.

, and . CoRR, (2023)

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.

 

Other publications of authors with the same name

Multitasking Capacity: Hardness Results and Improved Constructions., , , , , , , and . SIAM J. Discret. Math., 34 (1): 885-903 (2020)A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs., and . CoRR, (2016)Inapproximability of Maximum Biclique Problems, Minimum $k$-Cut and Densest At-Least-$k$-Subgraph from the Small Set Expansion Hypothesis.. CoRR, (2017)Tight Running Time Lower Bounds for Strong Inapproximability of Maximum k-Coverage, Unique Set Cover and Related Problems (via t-Wise Agreement Testing Theorem).. CoRR, (2019)Private Aggregation from Fewer Anonymous Messages., , , and . CoRR, (2019)On Differentially Private Sampling from Gaussian and Product Distributions., , , and . CoRR, (2023)On Inapproximability of Reconfiguration Problems: PSPACE-Hardness and some Tight NP-Hardness Results., and . Electron. Colloquium Comput. Complex., (2024)On Deep Learning with Label Differential Privacy., , , , and . CoRR, (2021)Differentially Private All-Pairs Shortest Path Distances: Improved Algorithms and Lower Bounds., , , and . CoRR, (2022)Summary Reports Optimization in the Privacy Sandbox Attribution Reporting API., , , , , , and . CoRR, (2023)