Funder
Sino-German Center for Research Promotion
Japan Society for the Promotion of Science London
National Natural Science Foundation of China
Publisher
Society for Industrial & Applied Mathematics (SIAM)
Subject
General Mathematics,General Computer Science
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Parameterized Inapproximability Hypothesis under Exponential Time Hypothesis;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10
2. Applications of Random Algebraic Constructions to Hardness of Approximation;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
3. Approximation and hardness of Shift-Bribery;Artificial Intelligence;2021-09
4. Constant approximating k-clique is w[1]-hard;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15
5. Automating Resolution is NP-Hard;Journal of the ACM;2020-10-16