The complexity of splitting necklaces and bisecting ham sandwiches-Reference-Cited by-同舟云学术

The complexity of splitting necklaces and bisecting ham sandwiches

Published:2019-06-23 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Filos-Ratsikas Aris¹,Goldberg Paul W.²

Affiliation:

1. EPFL, Switzerland

2. University of Oxford, UK

Funder

European Research Council

Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3313276.3316334

Reference54 articles.

1. J. Aisenberg M.L. Bonet and S. Buss. 2-D Tucker is PPA complete. Electronic Colloquium on Computational Complexity TR15-163 (2015). J. Aisenberg M.L. Bonet and S. Buss. 2-D Tucker is PPA complete. Electronic Colloquium on Computational Complexity TR15-163 (2015).

2. Splitting necklaces

3. Some recent Combinatorial Applications of Borsuk-type Theorems. London Mathematical Society Lecture Notes Series 131, Algebraic;Alon N.;Extremal and Metric Combinatorics,1986

4. The Borsuk-Ulam theorem and bisection of necklaces

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Consensus-Halving: Does It Ever Get Easier?;SIAM Journal on Computing;2023-04-04

2. Two's company, three's a crowd: Consensus-halving for a constant number of agents;Artificial Intelligence;2022-12

3. Consensus Halving for Sets of Items;Mathematics of Operations Research;2022-11

4. The Complexity of Finding Fair Independent Sets in Cycles;computational complexity;2022-10-11

5. Constant inapproximability for PPA;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09