Given a polytope S, a polytope P containing S, and a number k, the Nested Polytope problem asks whether there is a polytope Q with at most k vertices that contains S and is contained in P. We show that the Nested Polytope problem is ETR-complete.

This is joint work with Andreas Holmsen and Tillmann Miltzow.