• Media type: Electronic Conference Proceeding; E-Article; Text
  • Title: Shadows of Newton Polytopes
  • Contributor: Hrubeš, Pavel [Author]; Yehudayoff, Amir [Author]
  • imprint: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2021
  • Language: English
  • DOI: https://doi.org/10.4230/LIPIcs.CCC.2021.9
  • Keywords: Monotone arithmetic circuit ; Newton polytope
  • Origination:
  • Footnote: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Description: We define the shadow complexity of a polytope P as the maximum number of vertices in a linear projection of P to the plane. We describe connections to algebraic complexity and to parametrized optimization. We also provide several basic examples and constructions, and develop tools for bounding shadow complexity.
  • Access State: Open Access