Document Open Access Logo

Shadows of Newton Polytopes

Authors Pavel Hrubeš, Amir Yehudayoff

PDF

File

Thumbnail PDF
PDF
LIPIcs.CCC.2021.9.pdf
  • Filesize: 0.74 MB
  • 23 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Algebraic complexity theory
Keywords
  • Newton polytope
  • Monotone arithmetic circuit

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

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.

Cite As Get BibTex

Pavel Hrubeš and Amir Yehudayoff. Shadows of Newton Polytopes. In 36th Computational Complexity Conference (CCC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 200, pp. 9:1-9:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021) https://doi.org/10.4230/LIPIcs.CCC.2021.9

Author Details

Pavel Hrubeš
  • Institute of Mathematics, The Czech Academy of Sciences, Prague, Czech Republic
Amir Yehudayoff
  • Department of Mathematics, Technion-IIT, Haifa, Israel

Funding

  • Hrubeš, Pavel: Supported by the GACR grant 19-27871X.

Acknowledgements

We thank Michael Forbes for pointing out the connection between shadow complexity and Conjecture 47.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact