Author:
Garg Jugal,Mehta Ruta,Vazirani Vijay V.,Yazdanbod Sadra
Publisher
Springer Berlin Heidelberg
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Smoothing the Gap Between NP and ER;SIAM Journal on Computing;2022-04-07
2. The Art Gallery Problem is ∃ℝ-complete;Journal of the ACM;2022-02-28
3. On Classifying Continuous Constraint Satisfaction problems;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
4. Framework for ER-Completeness of Two-Dimensional Packing Problems;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11
5. Smoothing the gap between NP and ER;2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS);2020-11