@inproceedings{e097bf972ccb480b856439bb21d8a4ac,
title = "Shadows of Newton polytopes",
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.",
keywords = "Monotone arithmetic circuit, Newton polytope",
author = "Pavel Hrube{\v s} and Amir Yehudayoff",
note = "Publisher Copyright: {\textcopyright} Pavel Hrube{\v s} and Amir Yehudayoff; licensed under Creative Commons License CC-BY 4.0; 36th Computational Complexity Conference, CCC 2021 ; Conference date: 20-07-2021 Through 23-07-2021",
year = "2021",
month = jul,
day = "1",
doi = "10.4230/LIPIcs.CCC.2021.9",
language = "الإنجليزيّة",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
pages = "1--23",
editor = "Valentine Kabanets",
booktitle = "Computational Complexity Conference",
}