Corpus ID: 237503611

The complexity of sharing a pizza

  title={The complexity of sharing a pizza},
  author={Patrick Schnider},
  • P. Schnider
  • Published 14 September 2021
  • Computer Science
  • ArXiv
Assume you have a 2-dimensional pizza with 2n ingredients that you want to share with your friend. For this you are allowed to cut the pizza using several straight cuts, and then give every second piece to your friend. You want to do this fairly, that is, your friend and you should each get exactly half of each ingredient. How many cuts do you need? It was recently shown using topological methods that n cuts always suffice. In this work, we study the computational complexity of finding such n… Expand

Figures from this paper


Sharing a Pizza: Bisecting Masses with Two Cuts
It is shown that given four mass distributions in the plane, they can be simultaneously bisected with two lines and the following extension of the well-known Ham-sandwich theorem is shown. Expand
On the computational complexity of Ham-Sandwich cuts, Helly sets, and related problems
The technique of embedding d-Sum into a geometric setting is conceptually much simpler than direct fpt-reductions from purely combinatorial W[1]-hard problems and has great potential to show (parameterized) hardness and (conditional) lower bounds for many other problems. Expand
Algorithms for ham-sandwich cuts
A linear-time algorithm for ham-sandwich cuts inR3 when the three sets are suitably separated is given, and the algorithm is optimal, having complexityO(n), which is proportional to the worst-case time needed for constructing a level in an arrangement ofn hyperplanes in dimensiond−1. Expand
Generalized Ham-Sandwich Cuts
The combinatorial proof inspires an O(n(log n)d−3) algorithm which, given positive integers ai≤|Pi|, finds the unique hyperplane h incident with a point in each Pi and having |h+∩Pi|=ai. Expand
Computing Exact Solutions of Consensus Halving and the Borsuk-Ulam Theorem
A new complexity class BU is defined, which captures all problems that can be reduced to solving an instance of the Borsuk-Ulam problem exactly, and it is shown that FIXP $\subseteq$ BU $\sub seteq$ TFETR and that LinearBU $=$ PPA, where LinearBU is the subclass of BU in which the BORSuk- Ulam instance is specified by a linear arithmetic circuit. Expand
The complexity of splitting necklaces and bisecting ham sandwiches
The computational complexity of two problems known as Necklace Splitting and Discrete Ham Sandwich are resolved, showing that they are PPA-complete, settling the status of PPA as a class that captures the complexity of “natural” problems whose definitions do not incorporate a circuit. Expand
Computational Complexity of the α-Ham-Sandwich Problem
It is shown that for the α-Ham-Sandwich theorem, the search problem of finding the dividing hyperplane lies in UEOPL, the first non-trivial containment of the problem in a complexity class and places it in the company of several classic search problems. Expand
Bisecting three classes of lines
This work devise an $O(n^2\log^2(n)$ time algorithm to find such a plane and the bisector of the induced cross-section and provides a general framework, from which it can be applied to solve similar problems on cross-sections and kinetic points. Expand
Complexity results on restricted instances of a paint shop problem for words
We study the following problem: an instance is a word with every letter occurring twice. A solution is a 2-coloring of its letters such that the two occurrences of every letter are colored withExpand
Using the Borsuk-Ulam Theorem: Lectures on Topological Methods in Combinatorics and Geometry
A number of important results in combinatorics, discrete geometry, and theoretical computer science have been proved using algebraic topology. While the results are quite famous, their proofs are notExpand