Publisher
Springer International Publishing
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Complexity of Recognizing Geometric Hypergraphs;Lecture Notes in Computer Science;2023
2. On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria;Theory of Computing Systems;2022-05-11
3. On Classifying Continuous Constraint Satisfaction problems;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
4. Covering Polygons is Even Harder;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
5. Computing exact solutions of consensus halving and the Borsuk-Ulam theorem;Journal of Computer and System Sciences;2021-05