( en | de | ru )

 

Disambiguation of "Sun, Yican"

Author of the publication

copydeleteadd this publication to your clipboard
Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH.

, , , , and . Electron. Colloquium Comput. Complex., (2024)

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.

Yü-Sün Sun

Hongqing Sun

Guolin Sun

Xianyong Sun

Han Sun

 

Other publications of authors with the same name

ASAC: A Benchmark for Algorithm Synthesis., , , , , , , , and . SIGSOFT FSE Companion, page 577-581. ACM, (2024)Quantitative Analysis of Assertion Violations in Probabilistic Programs., , , , and . CoRR, (2020)Improved Hardness of Approximating k-Clique under ETH., , , and . FOCS, page 285-306. IEEE, (2023)Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis., , , , and . STOC, page 24-35. ACM, (2024)Automated Tail Bound Analysis for Probabilistic Recurrence Relations., , , and . CAV (3), volume 13966 of Lecture Notes in Computer Science, page 16-39. Springer, (2023)On Lower Bounds of Approximating Parameterized k-Clique., , , and . ICALP, volume 229 of LIPIcs, page 90:1-90:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Almost Optimal Time Lower Bound for Approximating Parameterized Clique, CSP, and More, under ETH., , , , and . Electron. Colloquium Comput. Complex., (2024)Guiding dynamic programing via structural probability for accelerating programming by example., , , and . Proc. ACM Program. Lang., 4 (OOPSLA): 224:1-224:29 (2020)Proving Functional Program Equivalence via Directed Lemma Synthesis., , , , , and . CoRR, (2024)Parameterized Inapproximability Hypothesis under ETH., , , , and . CoRR, (2023)