eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2021-07-08
9:1
9:23
10.4230/LIPIcs.CCC.2021.9
article
Shadows of Newton Polytopes
Hrubeš, Pavel
1
Yehudayoff, Amir
2
Institute of Mathematics, The Czech Academy of Sciences, Prague, Czech Republic
Department of Mathematics, Technion-IIT, Haifa, Israel
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.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol200-ccc2021/LIPIcs.CCC.2021.9/LIPIcs.CCC.2021.9.pdf
Newton polytope
Monotone arithmetic circuit