Deligkas, Argyrios and Fearnley, John and Hollender, Alexandros and Melissourgos, Themistoklis (2025) Constant Inapproximability for PPA. SIAM Journal on Computing, 54 (1). pp. 163-192. DOI https://doi.org/10.1137/22M1536613
Deligkas, Argyrios and Fearnley, John and Hollender, Alexandros and Melissourgos, Themistoklis (2025) Constant Inapproximability for PPA. SIAM Journal on Computing, 54 (1). pp. 163-192. DOI https://doi.org/10.1137/22M1536613
Deligkas, Argyrios and Fearnley, John and Hollender, Alexandros and Melissourgos, Themistoklis (2025) Constant Inapproximability for PPA. SIAM Journal on Computing, 54 (1). pp. 163-192. DOI https://doi.org/10.1137/22M1536613
Abstract
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | TFNP; PPA; fair division; consensus halving; ham sandwich theorem |
| Divisions: | Faculty of Science and Health Faculty of Science and Health > Computer Science and Electronic Engineering, School of |
| SWORD Depositor: | Unnamed user with email elements@essex.ac.uk |
| Depositing User: | Unnamed user with email elements@essex.ac.uk |
| Date Deposited: | 16 Oct 2024 12:42 |
| Last Modified: | 14 Feb 2025 15:41 |
| URI: | http://repository.essex.ac.uk/id/eprint/39415 |
Available files
Filename: Constant Inapproximability for PPA.pdf
Licence: Creative Commons: Attribution 4.0