The complexity of sharing a pizza

DOI10.4230/LIPICS.ISAAC.2021.13MaRDI QIDQ6187794zbMATH OpenFDO

Authors Patrick Schnider

Publication date 15 January 2024

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2021.13

zbMATH Keywords

computational complexitycomputational geometryham-sandwich theorempizza sharingPPA

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• scientific article; zbMATH DE number 7662165
• Fair Partitioning by Straight Lines
• Solution of Peter Winkler's pizza problem
• Solution of Peter Winkler's pizza problem
• Of cheese and crust: a proof of the pizza conjecture and other tasty results

Cited in

(3)

• Further collapses in \(\mathsf{TFNP}\)
• Pizza sharing is PPA-hard
• Cookie cutters: bisections with fixed shapes

This page was built for publication: The complexity of sharing a pizza

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6187794)