Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference19 articles.
1. Inapproximability of vertex cover and independent set in bounded degree graphs;Austrin;Theory Comput.,2011
2. Proof verification and the hardness of approximation problems;Arora;J. ACM,1998
3. Probabilistic checking of proofs: a new characterization of NP;Arora;J. ACM,1998
4. Network design for vertex connectivity;Chakraborty,2008
5. Approximation resistance from pairwise-independent subgroups;On Chan;J. ACM,2016
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Survivable Network Design Revisited: Group-Connectivity;2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS);2022-10